The authors claim to prove that every grounded tree is unavoidable in every sufficiently large directed graph of large minimum out-degree, confirming the KAMAK tree conjecture.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Proof of the KAMAK tree conjecture
The authors claim to prove that every grounded tree is unavoidable in every sufficiently large directed graph of large minimum out-degree, confirming the KAMAK tree conjecture.