Shi and Shan's conjecture for tough connected (P_2∪ kP_1)-free graphs
Statement
Let be an integer with , and let be a graph. Here denotes the path on vertices, is the disjoint union of a two-vertex path and isolated vertices, a graph is -tough when its toughness is at least , and -connected when deleting fewer than vertices leaves it connected. The graph is -free if it has no induced subgraph isomorphic to . Shi and Shan's conjecture. Every -tough, -connected -free graph is Hamiltonian. Shi and Shan had proved the analogous statement with -toughness for ; the conjecture weakens the toughness requirement to and remains open in the supplied source.
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.