Large graphs with edge density 1/2 + o(1) contain an ℓ-path between two equal-degree vertices, and this density threshold is tight for odd ℓ.
Springer , year=
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
-
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
Large graphs with edge density 1/2 + o(1) contain an ℓ-path between two equal-degree vertices, and this density threshold is tight for odd ℓ.