Jackson–Wormald conjecture on walks in highly connected star-free graphs
Statement
Let and be integers, and let be a -connected -free graph. Jackson–Wormald's conjecture. Then has a -walk. Jin and Li provided counterexamples for , whereas the case follows from the cited theorem; thus the conjecture is refuted in general.
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.