Yin and Wu's size interpolation conjecture for 2-connected subgraphs
Let be a 2-connected graph of order and size .
Yin and Wu's size interpolation conjecture. If
then has a -connected subgraph of order for each .
The conjecture is explicitly stated by Yin and Wu and is disproved in the present paper by construction of counterexamples.
References
- Haiyang Liu and Bo Ning, “An Improved Interpolation Theorem and Disproofs of Two Conjectures on 2-Connected Subgraphs”, arXiv:2603.11662 (2026).
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.