HZ-graph classification equivalent to the Core Conjecture
HZ-graph classification equivalent to the Core Conjecture
Let be an HZ-graph, meaning a connected Class 2 graph with , and let be the Petersen graph with one vertex removed. Let be the graph class defined in the paper. HZ-graph classification conjecture. If is an HZ-graph with maximum degree , then either , or and is an odd cycle, or and . This is presented as an equivalent reformulation of the Core Conjecture and is therefore solved together with it.
Sources & referencesView supporting material
Primary source
Yan Cao, Guantao Chen, Guangming Jing and Songling Shan, “Proof of the Core Conjecture of Hilton and Zhao”, arXiv:2004.00734 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.