Kashima’s pancyclicity analogue conjecture
Kashima’s pancyclicity analogue conjecture
For every integer , every -connected graph of order with minimum degree contains a -connected subgraph of every order .
Progress summary
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 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 scale, but it does not establish that threshold.
Current status (as of August 2026): A sublinear sufficient condition is available, while Kashima’s conjectured threshold and the full conjecture remain open.
Sources
Sources & referencesView supporting material
Primary source
Additional references
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.