On Directed Versions of the Hajnal–Szemerédi Theorem

DOI10.1017/S0963548315000036zbMath1371.05234arXiv1406.3229OpenAlexW2963269116MaRDI QIDQ5364261

Andrew Treglown

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/1406.3229

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Transitive triangle tilings in oriented graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ 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
• On directed versions of the Corrádi-Hajnal corollary
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• A new proof of the graph removal lemma
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Triangle packings and 1-factors in oriented graphs
• Proof of the Seymour conjecture for large graphs
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• The minimum degree threshold for perfect graph packings
• An Ore-type theorem on equitable coloring
• A note on some embedding problems for oriented graphs
• On the Complexity of General Graph Factor Problems
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An Ore-type Theorem for Perfect Packings in Graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• A geometric theory for hypergraph matching
• Disjoint directed quadrilaterals in a directed graph
• Testing subgraphs in directed graphs
• Independent directed triangles in a directed graph

This page was built for publication: On Directed Versions of the Hajnal–Szemerédi Theorem