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.
Refined Absorption: A New Proof of the Existence Conjecture
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.
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.
-
Universality for rainbow oriented cycles in perturbed digraphs
Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.