On quadrilaterals in a graph Original Research Article

Let G be a graph of order 4k, where k is a positive integer. Suppose that the minimum degree of G is at least 2k. We show that G contains k−1 quadrilaterals and a subgraph of order 4 with at least 4 edges such that all of them are mutually vertex-disjoint.