Abstract

We prove that any claw of order n with degree d≤ 3 8 n is n-unavoidable, which means that any tournament of order n contains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call