On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem

DOI10.1137/18M1211970zbMath1436.05087arXiv1806.03530OpenAlexW3014219995MaRDI QIDQ4959763

Rajko Nenadov, Yanitsa Pehova

Publication date: 7 April 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreeextremal graph theorygraph factorsgraph tilings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

Disjoint cycles in graphs with restricted independence number ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Graph Tilings in Incompatibility Systems ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Factors in randomly perturbed hypergraphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ \(K_r\)-factors in graphs with low independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• More results on Ramsey-Turán type problems
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Vertex coverings by monochromatic cycles and trees
• Matching and covering the vertices of a random graph by copies of a given graph
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• \(F\)-factors in hypergraphs via absorption
• Graph Theory
• Triangle factors of graphs without large independent sets and of weighted graphs
• Triangle-Tilings in Graphs Without Large Independent Sets
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Turán-Ramsey Theorems and K_p-Independence Numbers
• Triangle Factors in Random Graphs
• Tilings in Randomly Perturbed Dense Graphs
• Exact Minimum Codegree Threshold for K⁻₄-Factors
• The Construction of Certain Graphs
• On the maximal number of independent circuits in a graph
• Ramsey-Turán theory
• Proof of the Alon-Yuster conjecture

This page was built for publication: On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem