Every sufficiently large triangle-divisible graph with minimum degree at least (7+√21)/14 + epsilon has a triangle decomposition with arbitrarily large girth.
On a hypergraph matching problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Erd\H{o}s meets Nash-Williams
Every sufficiently large triangle-divisible graph with minimum degree at least (7+√21)/14 + epsilon has a triangle decomposition with arbitrarily large girth.