Dense layouts for series-parallel circuits

The authors address the question `when do three tracks suffice for the gate matrix layout of series-parallel circuits?´ and demonstrate that the rather surprising answer appears to be `almost always.´ This is in contrast to the fact that an unbounded number of tracks may be required to layout contrived instances in the worst case. Their approach stems from the novel nonconstructive finite-basis characterization of graphs with k-track layouts for any fixed k