HZ-graph classification equivalent to the Core Conjecture

About 6 years old · traced to

Let GG be an HZ-graph, meaning a connected Class 2 graph with Δ(GΔ)≤2\Delta(G_\Delta)\le2, and let P∗P^* be the Petersen graph with one vertex removed. Let OΔ\mathcal{O}_\Delta be the graph class defined in the paper. HZ-graph classification conjecture. If GG is an HZ-graph with maximum degree Δ\Delta, then either G∈OΔG\in\mathcal{O}_\Delta, or Δ=2\Delta=2 and GG is an odd cycle, or Δ=3\Delta=3 and G=P∗G=P^*. This is presented as an equivalent reformulation of the Core Conjecture and is therefore solved together with it.

References

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.