Return
Alternating paths in oriented graphs with large semidegree
DOI:10.37236/13084.png)
Abstract
En 中文
In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomasse, we prove that every oriented graph with all in-and out-degrees greater than 5k/8 contains an alternating path of length k. This improves on previous results of Klimosova and Stein, and Chen, Hou and Zhou.
Keywords:
HAMILTON CYCLES
Journal
E
IF:
0.7
Papers:
173
Citations:
0

