ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with minimum degree \Greekmath010E\Greekmath 010E and connectivity \Greekmath0114\Greekmath 0114 , where 1≤\Greekmath0114≤\Greekmath010E1\leq\Greekmath 0114 \leq\Greekmath 010E . Let CC be a longest cycle in GG, and let p‾\overline{p} be the order of a longest path in G−CG-C.

Jung's reverse minimum-degree conjecture. If p‾≥\Greekmath0114−1\overline{p}\geq\Greekmath 0114 -1, then

c≥\Greekmath0114(\Greekmath010E−\Greekmath0114+2).c\geq\Greekmath 0114 (\Greekmath 010E -\Greekmath 0114 +2).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.