\(K_r\)-factors in graphs with low independence number
From MaRDI portal
Publication:1998757
DOI10.1016/j.jctb.2020.12.006zbMath1459.05329arXiv1912.00230OpenAlexW3115851297MaRDI QIDQ1998757
Publication date: 8 March 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00230
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
Disjoint cycles in graphs with restricted independence number ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Clique-factors in graphs with sublinear -independence number ⋮ A Ramsey–Turán theory for tilings in graphs
Cites Work
- A degree sequence Hajnal-Szemerédi theorem
- More results on Ramsey-Turán type problems
- Perfect matchings in uniform hypergraphs with large minimum degree
- Quadripartite version of the Hajnal-Szemerédi theorem
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- On a Ramsey-Turán type problem
- A few remarks on Ramsey--Turán-type problems
- Tripartite version of the Corrádi-Hajnal theorem
- Triangle factors of graphs without large independent sets and of weighted graphs
- Triangle-Tilings in Graphs Without Large Independent Sets
- Graph Theory and Probability. II
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Ramsey-Turán theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(K_r\)-factors in graphs with low independence number
