|
|||||
|
|
Tight embeddings of partial quadrilateral packings |
|
| Authors: | Zoltán Füredi Jen? Lehel |
| Institution: | a Alfréd Rényi Institute, Hungarian Academy of Sciences, Budapest, PO Box 127, Hungary, H-1364 b Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA c Department of Mathematical Sciences, The University of Memphis, Memphis, TN, USA d Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary |
| Abstract: | Let f(n;C4) 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;C4) additional vertices. It is known, and it is easy to show, that  . Here we settle the longstanding problem that  . |
| Keywords: | Graphs Packings H-designs Quadrilaterals |
| 本文献已被 ScienceDirect 等数据库收录！ | |