Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity

Abstract

A graph is fractionally Hamiltonian if it admits a nonnegative edge weighting in [0,1] of total weight equal to its order such that every nontrivial edge cut has weight at least two. Motivated by Chvátal's Toughness Conjecture, Scheinerman and Ullman conjectured that every $2$-tough graph is fractionally Hamiltonian. In this paper, we show that every connected graph on at least three vertices that is not fractionally Hamiltonian has a non-Hamiltonian chordal spanning supergraph. Since adding edges does not decrease toughness, a theorem of Kabela and Kaiser that every $10$-tough chordal graph on at least three vertices is Hamiltonian yields that every $10$-tough graph on at least three vertices is fractionally Hamiltonian. We apply this result to resistance curvature. We prove that every fractionally Hamiltonian graph is resistance positive (RP), and consequently every $10$-tough graph is RP, confirming a conjecture of Devriendt. In the other direction, for every ε>0, we construct a graph that is not resistance nonnegative and has toughness greater than 3/2−ε, extending a recent construction of Agrahari, Bibby, Boros, Garcia, Heidercheidt, and Wang.

Asymptotic connectivity, hamiltonicity and toughness
Agelos Georgakopoulos
arXiv7 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
Connectivity, toughness, and hamiltonicity of simplicial polytopes
Guillermo Pineda-Villavicencio
arXiv9 Oct 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
Integral Harnack inequality and expansion of positivity for fractional porous medium equation
Filippo Maria Cassanello, Filomena De Filippis, Calvin Stanko
arXiv7 Oct 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv
Ellipsoidal Positivity Sets for Fractional Obstacle Problems with Quadratic Forcing
Shuhei Kitano
arXiv1 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds
William Johnson
arXiv17 Oct 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematics Dynamical systemsarXiv

Cite

BibTeX RIS

BibTeX

@misc{wang2026toughness,
  title = {{Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity}},
  author = {Zhiyu Wang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.03412},
  eprint = {2609.03412},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.03412},
}

RIS

TY  - UNPB
TI  - Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity
AU  - Zhiyu Wang
PY  - 2026
DA  - 2026/09/03
PB  - arXiv
DO  - 10.48550/arxiv.2609.03412
UR  - https://arxiv.org/abs/2609.03412
AB  - A graph is fractionally Hamiltonian if it admits a nonnegative edge weighting in [0,1] of total weight equal to its order such that every nontrivial edge cut has weight at least two. Motivated by Chvátal's Toughness Conjecture, Scheinerman and Ullman conjectured that every $2$-tough graph is fractionally Hamiltonian. In this paper, we show that every connected graph on at least three vertices that is not fractionally Hamiltonian has a non-Hamiltonian chordal spanning supergraph. Since adding edges does not decrease toughness, a theorem of Kabela and Kaiser that every $10$-tough chordal graph on at least three vertices is Hamiltonian yields that every $10$-tough graph on at least three vertices is fractionally Hamiltonian. We apply this result to resistance curvature. We prove that every fractionally Hamiltonian graph is resistance positive (RP), and consequently every $10$-tough graph is RP, confirming a conjecture of Devriendt. In the other direction, for every ε>0, we construct a graph that is not resistance nonnegative and has toughness greater than 3/2−ε, extending a recent construction of Agrahari, Bibby, Boros, Garcia, Heidercheidt, and Wang.
ER  -

Abstract

Related

Cite