Generalized Hamilton-connectedness conjecture for forbidden-star split graphs
Statement
Let be an integer. A graph is split if its vertex set can be partitioned into a clique and an independent set. It is -free if it contains no induced subgraph isomorphic to either forbidden graph, where is obtained from 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 -connected -free split graph of order at least is Hamilton-connected.
The conjecture is motivated by the paper's theorem for , namely that every -connected -free split graph of order at least 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.