ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be an integer with k≥4k\ge 4, and let GG be a graph. Here PnP_n denotes the path on nn vertices, P2∪kP1P_2\cup kP_1 is the disjoint union of a two-vertex path and kk isolated vertices, a graph is 11-tough when its toughness is at least 11, and 2k2k-connected when deleting fewer than 2k2k vertices leaves it connected. The graph is (P2∪kP1)(P_2\cup kP_1)-free if it has no induced subgraph isomorphic to P2∪kP1P_2\cup kP_1. Shi and Shan's conjecture. Every 11-tough, 2k2k-connected (P2∪kP1)(P_2\cup kP_1)-free graph is Hamiltonian. Shi and Shan had proved the analogous statement with 44-toughness for k≥4k\ge4; the conjecture weakens the toughness requirement to 11 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 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.