Kao's sharpness conjecture for Hamiltonicity of graph–path products
Statement
A path factor of a graph is a factor whose components are paths on at least two vertices. Let be the path on vertices, and let denote the maximum degree of a graph . Kao's conjecture. For every integer , there exists a connected graph with a path factor and such that
is not hamiltonian. This is the main result stated in the paper and is a more specific formulation of the sharpness phenomenon for the bound ; the paper presents it as a conjecture from Kao and proves it.
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.