A Ramsey–Turán theory for tilings in graphs
From MaRDI portal
Publication:6185051
DOI10.1002/rsa.21182zbMath1529.05154arXiv2106.09688OpenAlexW4385409688MaRDI QIDQ6185051
Patrick Morris, Jie Han, Donglei Yang, Guang-Hui Wang
Publication date: 5 January 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09688
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle factors in sparse pseudo-random graphs
- More results on Ramsey-Turán type problems
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Induced subtrees in graphs of large chromatic number
- On a Ramsey-Turán type problem
- Tiling Turán theorems
- 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
- Clique-factors in sparse pseudorandom graphs
- Spanning trees in random graphs
- \(F\)-factors in hypergraphs via absorption
- Triangle factors of graphs without large independent sets and of weighted graphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- Triangle-Tilings in Graphs Without Large Independent Sets
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- Graph Theory and Probability
- A proof of Alon’s second eigenvalue conjecture and related problems
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Proof of a tiling conjecture of Komlós
- Adding random edges to dense graphs
- Hamilton Cycles, Minimum Degree, and Bipartite Holes
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- Triangle‐factors in pseudorandom graphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Tilings in Randomly Perturbed Dense Graphs
- A geometric theory for hypergraph matching
- The Construction of Certain Graphs
- On the maximal number of independent circuits in a graph
- Triangles in randomly perturbed graphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Ramsey-Turán theory
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
This page was built for publication: A Ramsey–Turán theory for tilings in graphs
