Clique-factors in graphs with sublinear -independence number

DOI10.1017/s0963548323000081zbMath1526.05073arXiv2203.02169OpenAlexW4366829720MaRDI QIDQ6064154

Guang-Hui Wang, Donglei Yang, Jie Han, Ping Hu

Publication date: 8 November 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey-Turánclique-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Expander graphs (05C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• The critical window for the classical Ramsey-Turán problem
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• On a Ramsey-Turán type problem
• Correlation inequalities on some partially ordered sets
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• On the Ramsey-Turán numbers of graphs and hypergraphs
• \(K_r\)-factors in graphs with low independence number
• The minimum degree threshold for perfect graph packings
• \(F\)-factors in hypergraphs via absorption
• Phase transitions in Ramsey-Turán theory
• A multipartite Hajnal-Szemerédi theorem
• The Ramsey-Turán problem for cliques
• An Ore-type theorem on equitable coloring
• Graph Theory
• Triangle factors of graphs without large independent sets and of weighted graphs
• Dependent random choice
• Some exact Ramsey-Turán numbers
• Triangle Factors in Random Graphs
• Two Conjectures in Ramsey--Turán Theory
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
• On Directed Versions of the Hajnal–Szemerédi Theorem
• The Construction of Certain Graphs
• Ramsey numbers of sparse hypergraphs
• Ramsey-Turán theory
• Embedding clique-factors in graphs with low \(\ell\)-independence number
• Factors in randomly perturbed hypergraphs
• F$F$‐factors in Quasi‐random Hypergraphs

This page was built for publication: Clique-factors in graphs with sublinear -independence number