Regular Graphs of High Degree are 1-Factorizable

Amanda G. Chetwynd, A. J. W. Hilton

Proceedings of the London Mathematical Society · 1985 · 95 citations · 6 references

Concepts

Abstract

It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ⩾ n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n—1 or 2n—2. We show here that it is true for d(G) equal to 2n — 3, 2n — 4, or 2n — 5. We also show that it is true for d(G) ⩾ 6 7 |V(G)|.

References

6