| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655679 | Journal of Combinatorial Theory, Series A | 2010 | 9 Pages |
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 .
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
