ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥3r\geq 3 be an integer. A graph is split if its vertex set can be partitioned into a clique and an independent set. It is K1,r+1,K1,r+1+e{K_{1,r+1},K_{1,r+1}+e}-free if it contains no induced subgraph isomorphic to either forbidden graph, where K1,r+1+eK_{1,r+1}+e is obtained from K1,r+1K_{1,r+1} by adding an edge joining two nonadjacent vertices. A graph is Hamilton-connected if every two distinct vertices are joined by a Hamiltonian path.

Generalized Hamilton-connectedness conjecture. Every rr-connected K1,r+1,K1,r+1+e{K_{1,r+1},K_{1,r+1}+e}-free split graph of order at least 2r+72r+7 is Hamilton-connected.

The conjecture is motivated by the paper's theorem for r=3r=3, namely that every 33-connected K1,4,K1,4+e{K_{1,4},K_{1,4}+e}-free split graph of order at least 1313 is Hamilton-connected. The general case is posed for further study and is unresolved in the supplied text.

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.