The authors prove that every triangle-divisible graph on n vertices with minimum degree at least (3/4)n has a triangle decomposition for large n.
Clique covers and decompositions of cliques of graphs.arXiv preprint arXiv:2412.05522, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Proof of Nash-Williams' Conjecture
The authors prove that every triangle-divisible graph on n vertices with minimum degree at least (3/4)n has a triangle decomposition for large n.