Triangle packings and 1-factors in oriented graphs

DOI10.1016/j.jctb.2008.12.004zbMath1208.05038arXiv0806.2027OpenAlexW2132505043MaRDI QIDQ1026012

Peter Keevash, Benjamin Sudakov

Publication date: 23 June 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.2027

zbMATH Keywords

cyclespackingdirected graphs

Mathematics Subject Classification ID

Extremal set theory (05D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (19)

Disjoint Cycles in a Digraph with Partial Degree ⋮ A note on some embedding problems for oriented graphs ⋮ Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths ⋮ On directed versions of the Corrádi-Hajnal corollary ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ A survey on Hamilton cycles in directed graphs ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Packing edge-disjoint triangles in regular and almost regular tournaments ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Transitive triangle tilings in oriented graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Packing and covering directed triangles asymptotically ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Packing Triangles in Regular Tournaments ⋮ Cyclic triangle factors in regular tournaments ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial and computational aspects of graph packing and graph decomposition
• Edge disjoint placement of graphs
• Complementary cycles of all lengths in tournaments
• Asymptotic behavior of the chromatic index for hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• On a packing and covering problem
• Blow-up lemma
• Matchings and covers in hypergraphs
• 2-factors in dense graphs
• \(H\)-factors in dense graphs
• Triangle-factors in a balanced blown-up triangle
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Embedding large subgraphs into dense graphs
• Long Cycles in Digraphs
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• The Blow-up Lemma
• Hamilton Cycles in Oriented Graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Packings in Dense Regular Graphs
• Hamiltonian Cycles in Regular Tournaments
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs
• Testing subgraphs in directed graphs
• Concentration of multivariate polynomials and its applications
• Proof of the Alon-Yuster conjecture

This page was built for publication: Triangle packings and 1-factors in oriented graphs