Vertex-disjoint quadrilaterals in graphs (Q704291): Difference between revisions

In this paper methods for finding vertex-disjoint quadrilaterals in a graph \(G\) are investigated. For a graph \(G\) of order \(n \not\equiv 0\pmod 4\) the author has found the best minimum degree condition \(\delta(G) \geq \lceil\frac{n}{2}\rceil\) such that \(G\) contains \(\lfloor\frac{n}{4}\rfloor\) vertex-disjoint quadrilaterals. As a consequence of this, every graph \(G\) of order \(n=4k\) and with \(\delta(G) \geq 2k-1\) contains \(k-1\) vertex-disjoint quadrilaterals.