Title of article :
Tight embeddings of partial quadrilateral packings
Author/Authors :
Füredi، نويسنده , , Zolt?n and Lehel، نويسنده , , Jen?، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
Let f ( n ; C 4 ) be the smallest integer such that, given any set of edge disjoint quadrilaterals on n vertices, one can extend it into a complete quadrilateral decomposition by including at most f ( n ; C 4 ) additional vertices. It is known, and it is easy to show, that n − 1 ⩽ f ( n ; C 4 ) . Here we settle the longstanding problem that f ( n ; C 4 ) = n + o ( n ) .
Keywords :
graphs , packings , H-designs , Quadrilaterals
Journal title :
Journal of Combinatorial Theory Series A
Journal title :
Journal of Combinatorial Theory Series A