Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
Ryan Odeneal, Andrei Pavelescu
TL;DR
This paper proves that any simple graph with 12 vertices and minimum degree 6 necessarily contains a K_6 minor, establishing a specific structural property for such graphs.
Contribution
It establishes a new result linking minimum degree and the presence of K_6 minors in graphs of order 12.
Findings
Graphs of order 12 with minimum degree 6 always contain a K_6 minor.
The result provides a specific case in the study of graph minors.
Advances understanding of structural properties in graph theory.
Abstract
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.