Cyclic Subsets of Tournaments
Random Structures & Algorithms · 2026-03 · 68 (2)
DOI: 10.1002/rsa.70056 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 06.03.2026. Verfasst von Zach Hunter und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung.
Abstract (Originalsprache)
Let be a Dirac graph, and let be a vertex subset of , chosen uniformly at random. How likely is the induced subgraph to be Hamiltonian? This question, proposed by Erdős and Faudree in 1996, was recently resolved by Draganić, Keevash, and Müyesser, in the setting of graphs. In this paper, we study a similar question for tournaments: If is a tournament of high minimum degree, how likely is it for a random induced subtournament of to be Hamiltonian? We prove an optimal bound on this probability, and extend the results to the regime where the subset is not sampled uniformly at random, but according to a ‐biased measure.
Förderung
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Zitieren
APA
Hunter, Z., Liu, T., Milojević, A., & Sudakov, B. (2026). Cyclic Subsets of Tournaments. Random Structures & Algorithms, 68(2). https://doi.org/10.1002/rsa.70056
Vancouver
Hunter Z, Liu T, Milojević A, Sudakov B. Cyclic Subsets of Tournaments. Random Structures & Algorithms. 2026;68(2). doi:10.1002/rsa.70056
BibTeX
@article{Hunter2026,
author = {Hunter, Zach and Liu, Teng and Milojević, Aleksa and Sudakov, Benny},
title = {Cyclic Subsets of Tournaments},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {68},
number = {2},
doi = {10.1002/rsa.70056}
}
EUVIMED