HZ-graph classification equivalent to the Core Conjecture
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.