Embedding clique-factors in graphs with low \(\ell\)-independence number
From MaRDI portal
Publication:6038592
DOI10.1016/j.jctb.2023.02.008zbMath1512.05331arXiv2111.10512MaRDI QIDQ6038592
Jae-Hoon Kim, Donglei Yang, Fan Chang, Guang-Hui Wang, Jie Han
Publication date: 2 May 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.10512
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)
Related Items (2)
Graph Tilings in Incompatibility Systems ⋮ Clique-factors in graphs with sublinear -independence number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time perfect matchings in dense hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- More results on Ramsey-Turán type problems
- Quadripartite version of the Hajnal-Szemerédi theorem
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- On a Ramsey-Turán type problem
- Blow-up lemma
- Tiling Turán theorems
- Tripartite version of the Corrádi-Hajnal theorem
- On Ramsey - Turan type theorems for hypergraphs
- \(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
- Spanning trees in random graphs
- \(F\)-factors in hypergraphs via absorption
- A multipartite Hajnal-Szemerédi theorem
- The average number of spanning trees in sparse graphs with given degrees
- Graph Theory
- Triangle factors of graphs without large independent sets and of weighted graphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- On the Complexity of General Graph Factor Problems
- Some exact Ramsey-Turán numbers
- Embedding large subgraphs into dense graphs
- Triangle Factors in Random Graphs
- Proof of a tiling conjecture of Komlós
- FORCING QUASIRANDOMNESS WITH TRIANGLES
- How many random edges make a dense graph hamiltonian?
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- On Directed Versions 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
- Proof of the Alon-Yuster conjecture
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
- Factors in randomly perturbed hypergraphs
- F$F$‐factors in Quasi‐random Hypergraphs
This page was built for publication: Embedding clique-factors in graphs with low \(\ell\)-independence number
