6533b86cfe1ef96bd12c8b49
RESEARCH PRODUCT
Claws contained in all n-tournaments
Xiaoyun Lusubject
Discrete mathematicsComputer Science::Computer Science and Game TheoryClawMathematics::CombinatoricsComputer Science::Neural and Evolutionary ComputationHamiltonian pathTheoretical Computer ScienceCombinatoricssymbols.namesakeCorollaryComputer Science::Discrete MathematicssymbolsDiscrete Mathematics and CombinatoricsTournamentMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1993-08-01 | Discrete Mathematics |