Paths with many shortcuts in tournaments
From MaRDI portal
Publication:2219961
DOI10.1016/j.disc.2020.112168zbMath1455.05034arXiv2009.13985OpenAlexW3089691663MaRDI QIDQ2219961
Publication date: 21 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.13985
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Powers of Hamilton cycles in tournaments
- Optimally ranking unrankable tournaments
- Tournaments and Semicomplete Digraphs
- The Voting Problem
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- On Sets of Consistent Arcs in a Tournament
- Disproof of a conjecture of Erdös and moser on tournaments
- Optimal ranking of tournaments