An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
From MaRDI portal
Publication:5364255
DOI10.1017/S0963548314000716zbMath1371.05101arXiv1307.4803OpenAlexW2162255574MaRDI QIDQ5364255
Theodore Molla, Louis DeBiasio, Henry A. Kierstead, Andrzej Czygrinow
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4803
Related Items (11)
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Transitive triangle tilings in oriented graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ A degree sequence Hajnal-Szemerédi theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On directed versions of the Corrádi-Hajnal corollary
- A fast algorithm for equitable coloring
- Largest digraphs contained in all n-tournaments
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Triangle packings and 1-factors in oriented graphs
- On the existence of disjoint cycles in a graph
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- An Ore-type theorem on equitable coloring
- A proof of Sumner's universal tournament conjecture for large tournaments
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- On the square of a Hamiltonian cycle in dense graphs
- Sufficient Conditions for Circuits in Graphs†
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Independent directed triangles in a directed graph
This page was built for publication: An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
