The asymptotic maximum number of edges in a graph with H-matching number below beta n is determined for the H-shaped tree, refuting Lang's 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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tiling $H$ in dense graphs
The asymptotic maximum number of edges in a graph with H-matching number below beta n is determined for the H-shaped tree, refuting Lang's conjecture.