Large Hamiltonian graphs with minimum degree n to the power 1 minus a small epsilon contain a 2-factor consisting of exactly k cycles.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Proves λ_P3(G) ≥ ⌊n/5⌋ (asymptotically tight) and λ_{P2∪P1}(T) ≥ ⌊n/3⌋-2 (poly-time) in triangulations, with degree-based bounds and a face-path characterization for triangle factors.
citing papers explorer
-
3-packings in Triangulations: Algorithms, bounds, and Complexity
Proves λ_P3(G) ≥ ⌊n/5⌋ (asymptotically tight) and λ_{P2∪P1}(T) ≥ ⌊n/3⌋-2 (poly-time) in triangulations, with degree-based bounds and a face-path characterization for triangle factors.