MVLSC Home · Issue Contents · Forthcoming Papers
The Critically Duo-free Infinite Tournaments
Nesrine Azizi and Nadia El Amri
This paper demonstrates that for a given infinite tournament 𝑇 without a dense order, 𝑇 is duo-free if and only if each finite subtournament of 𝑇 is included in one of its duo-free finite subtournaments. Our study also provides a thorough description of duo-free infinite tournaments which fail to have this characteristic by removing an arbitrary vertex.
MSC (2020): 05C20, 05C63, 05C75, 06A05, 06A06
Keywords: Module, duo, d-indecomposability graph, critically duo-free tournament