Antipaths in oriented graphs
From MaRDI portal
Publication:6098098
Abstract: We show that for any natural number , any oriented graph of minimum semidegree at least contains an antidirected path of length . In fact, a slightly weaker condition on the semidegree sequence of suffices, and as a consequence, we confirm a weakened antidirected path version of a conjecture of Addario-Berry, Havet, Linhares Sales, Thomass'e and Reed.
Recommendations
Cites work
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 3632516 (Why is no real title available?)
- scientific article; zbMATH DE number 1047732 (Why is no real title available?)
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- Hamilton Cycles in Oriented Graphs
- Long paths and cycles in oriented graphs
- Oriented hamilton cycles in digraphs
- Oriented trees in digraphs
- Some Theorems on Abstract Graphs
- Tree containment and degree conditions
Cited in
(4)
This page was built for publication: Antipaths in oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098098)