Lichiardopol's conjecture on disjoint cycles in tournaments
From MaRDI portal
Publication:2188844
DOI10.37236/7715zbMath1441.05093arXiv1707.02384OpenAlexW3037062898WikidataQ123251599 ScholiaQ123251599MaRDI QIDQ2188844
Jin Yan, Douglas B. West, Fuhong Ma
Publication date: 15 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02384
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items
On disjoint cycles of the same length in tournaments ⋮ Vertex‐disjoint cycles of the same length in tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- On the Corrádi-Hajnal theorem and a question of Dirac
- Disjoint cycles in digraphs
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
- Girth in graphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- Disjoint directed cycles
- Vertex-disjoint cycles of the same length.
- An improved bound for disjoint directed cycles
- The confirmation of a conjecture on disjoint cycles in a graph
- Disjoint cycles of different lengths in graphs and digraphs
- Fan-type condition on disjoint cycles in a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On the number of disjoint 4-cycles in regular tournaments
- Partitioning vertices of a tournament into independent cycles
- Vertex-disjoint cycles of the same length
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- Disjoint cycles in graphs with distance degree sum conditions
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
- Cycles in digraphs– a survey
- Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
- On Subtournaments of a Tournament
- On the maximal number of independent circuits in a graph
- Vertex-disjoint cycles in bipartite tournaments
