Ramsey numbers of sparse hypergraphs
From MaRDI portal
Publication:5893929
DOI10.1002/rsa.20260zbMath1203.05099arXiv0710.0027OpenAlexW3083517466MaRDI QIDQ5893929
Jacob Fox, David Conlon, Benjamin Sudakov
Publication date: 9 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.0027
Related Items
Simplicial homeomorphs and trace-bounded hypergraphs, Boolean lattices: Ramsey properties and embeddings, On two problems in graph Ramsey theory, Ramsey numbers of 3-uniform loose paths and loose cycles, Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs, Clique-factors in graphs with sublinear -independence number, Monochromatic loose-cycle partitions in hypergraphs, Erdős-Szekeres theorem for multidimensional arrays, On the Ramsey-Turán numbers of graphs and hypergraphs, Monochromatic bounded degree subgraph partitions, Ramsey numbers of ordered graphs, Hypergraph Ramsey numbers, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Dependent random choice, The Ramsey number of Fano plane versus tight path, A hypergraph blow-up lemma, Minimal ordered Ramsey graphs, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles, Phase transitions in Ramsey-Turán theory, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
Cites Work
- Unnamed Item
- A new upper bound for diagonal Ramsey numbers
- The Ramsey number of a graph with bounded maximum degree
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Density theorems for bipartite graphs and related Ramsey-type results
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the Ramsey number of sparse 3-graphs
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A few remarks on Ramsey--Turán-type problems
- Ramsey numbers for sparse graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- On graphs with small Ramsey numbers*
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- On graphs with linear Ramsey numbers
- On Ramsey Numbers of Sparse Graphs
- Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- On bipartite graphs with linear Ramsey numbers