Sizes of Induced Subgraphs of Ramsey Graphs
From MaRDI portal
Publication:3552509
DOI10.1017/S0963548309009869zbMath1194.05104MaRDI QIDQ3552509
Noga Alon, József Balogh, Wojciech Samotij, Alexandr V. Kostochka
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (5)
The multiplication table problem for bipartite graphs ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Anticoncentration for subgraph statistics ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs
Cites Work
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Erdős and Rényi conjecture
- Some recent problems and results in graph theory
- Non-Ramsey graphs are \(c\log n\)-universal
- On a Ramsey type theorem
- Induced subgraphs with distinct sizes
- Cutting a graph into two dissimilar halves
- Induced subgraphs of prescribed size
This page was built for publication: Sizes of Induced Subgraphs of Ramsey Graphs
