Jung's reverse minimum-degree conjecture for long cycles
Statement
Let be a graph with minimum degree and connectivity , where . Let be a longest cycle in , and let be the order of a longest path in .
Jung's reverse minimum-degree conjecture. If , then
This is the minimum-degree reverse analogue of Bondy's conjecture. The paper presents the minimum-degree versions as popular and much-studied statements that remain unsolved.
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.