Hypergraph Packing and Sparse Bipartite Ramsey Numbers
From MaRDI portal
Publication:3557517
DOI10.1017/S0963548309990174zbMath1191.05064MaRDI QIDQ3557517
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)
Related Items (13)
Short proofs of some extremal results. II. ⋮ On two problems in graph Ramsey theory ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic bounded degree subgraph partitions ⋮ On the Ramsey number of the triangle and the cube ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Short Proofs of Some Extremal Results ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Ramsey-goodness -- and otherwise ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ Short proofs of some extremal results III ⋮ The Ramsey number of the clique and the hypercube
Cites Work
- On graphs with small Ramsey numbers. II.
- Edge disjoint placement of graphs
- The Ramsey number of a graph with bounded maximum degree
- The tail is cut for Ramsey numbers of cubes
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Lower bounds of tower type for Szemerédi's uniformity lemma
- A few remarks on Ramsey--Turán-type problems
- Ramsey numbers for sparse graphs
- Graphs with linearly bounded Ramsey numbers
- On graphs with small Ramsey numbers*
- Cube Ramsey numbers are polynomial
- Subdivided graphs have linear ramsey numbers
- On graphs with linear Ramsey numbers
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On Ramsey Numbers of Sparse Graphs
- Hypergraph Packing and Graph Embedding
- On bipartite graphs with linear Ramsey numbers
This page was built for publication: Hypergraph Packing and Sparse Bipartite Ramsey Numbers
