On the number of disjoint 4-cycles in regular tournaments

DOI10.7151/dmgt.2020zbMath1383.05262OpenAlexW2775143985MaRDI QIDQ1708396

Fuhong Ma, Jin Yan

Publication date: 23 March 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2020

zbMATH Keywords

disjoint cyclesregular tournament\(C_4\)-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On disjoint cycles of the same length in tournaments ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments

Cites Work

• Vertex-disjoint cycles in regular tournaments
• Disjoint cycles in digraphs
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• 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
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: On the number of disjoint 4-cycles in regular tournaments