Cyclic triangle factors in regular tournaments
From MaRDI portal
Publication:2335694
zbMath1432.05082arXiv1806.06903MaRDI QIDQ2335694
Publication date: 15 November 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06903
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Vertex‐disjoint cycles of the same length in tournaments ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect matchings in 3-partite 3-uniform hypergraphs
- Approximate multipartite version of the Hajnal-Szemerédi theorem
- Combinatorial and computational aspects of graph packing and graph decomposition
- Polynomial-time perfect matchings in dense hypergraphs
- Quadripartite version of the Hajnal-Szemerédi theorem
- Triangle packings and 1-factors in oriented graphs
- Tiling transitive tournaments and their blow-ups
- Tripartite version of the Corrádi-Hajnal theorem
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Triangle-factors in a balanced blown-up triangle
- Transitive triangle tilings in oriented graphs
- \(F\)-factors in hypergraphs via absorption
- A multipartite Hajnal-Szemerédi theorem
- A note on some embedding problems for oriented graphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- TILING DIRECTED GRAPHS WITH TOURNAMENTS
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- Independent directed triangles in a directed graph
This page was built for publication: Cyclic triangle factors in regular tournaments
