ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A path factor of a graph is a factor whose components are paths on at least two vertices. Let PmP_m be the path on mm vertices, and let Δ(G)\Delta(G) denote the maximum degree of a graph GG. Kao's conjecture. For every integer k≥3k\geq 3, there exists a connected graph GG with a path factor and Δ(G)=k\Delta(G)=k such that

P4k−4□GP_{4k-4}\Box G

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 n≥4Δ(T)−2n\geq 4\Delta(T)-2; 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 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.