Kashima’s pancyclicity analogue conjecture

For every integer n4n\ge 4, every 22-connected graph GG of order nn with minimum degree δ(G)3n\delta(G)\ge \sqrt{3n} contains a 22-connected subgraph of every order {4,5,,n}\ell\in\{4,5,\ldots,n\}.

Progress summary

Partially solved

A new preprint gives the first sublinear sufficient condition related to Kashima’s conjecture, but it does not reach the conjectured threshold.

Kashima’s conjecture predicts a minimum-degree threshold of order 3n\sqrt{3n} for the relevant pancyclicity analogue. The conjecture itself is not settled.

August 2026 sublinear bound

A preprint titled “A Sublinear Minimum-Degree Condition for 2-Connected Subgraphs of All Orders” reduces the sufficient minimum-degree requirement from linear order to a sublinear bound. This is the first such sublinear sufficient condition toward Kashima’s conjectured 3n\sqrt{3n} scale, but it does not establish that threshold.

Current status (as of August 2026): A sublinear sufficient condition is available, while Kashima’s conjectured 3n\sqrt{3n} threshold and the full conjecture remain open.

Sources
Sources & referencesView supporting material

Solutions 0

No solutions have been posted yet.