Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected

Feng Liu

REVIEW

Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.12860 v1 pith:UOA64ABE submitted 2025-03-17 math.CO

Feng Liu This is my paper · ORCID

classification math.CO

keywords graphfreeconnectedeverygreaterhamiltonian-connectedtoughnessbeen

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

abstract

Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. Shi and Shan conjectured that every $1$-tough $2k$-connected $(P_2 \cup kP_1)$-free graph is hamiltonian for $k \geq 4$. This conjecture has been independently confirmed by Xu, Li, and Zhou, as well as by Ota and Sanka. Inspired by this, we prove that every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected.

Discussion (0). Continue with ORCID to comment.

Pith tools