Every oriented graph with minimum pseudo-semidegree greater than (k-1+√(k-3))/2 contains an antidirected path of length k, asymptotically matching the conjectured k/2 threshold.
Addario-Berry, F
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
-
Antidirected paths in oriented graphs
Every oriented graph with minimum pseudo-semidegree greater than (k-1+√(k-3))/2 contains an antidirected path of length k, asymptotically matching the conjectured k/2 threshold.