Sizes of induced subgraphs of Ramsey graphs
From MaRDI portal
Publication:3552509
DOI10.1017/S0963548309009869zbMATH Open1194.05104MaRDI QIDQ3552509FDOQ3552509
Authors: Noga Alon, József Balogh, Wojciech Samotij, Alexandr Kostochka 
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Cites Work
- Cutting a graph into two dissimilar halves
- On a Ramsey type theorem
- Some recent problems and results in graph theory
- Induced subgraphs of prescribed size
- Non-Ramsey graphs are \(c\log n\)-universal
- Induced subgraphs with distinct sizes
- Erdős and Rényi conjecture
- Induced subgraphs of Ramsey graphs with many distinct degrees
Cited In (13)
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Anticoncentration for subgraph statistics
- An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Title not available (Why is that?)
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Ramsey graphs induce subgraphs of quadratically many sizes
- The multiplication table problem for bipartite graphs
- On the number of distinct induced subgraphs of a graph
- Distinct degrees in induced subgraphs
- Induced subgraphs of prescribed size
- Ramsey graphs induce subgraphs of many different sizes
- Induced subgraphs with distinct sizes
This page was built for publication: Sizes of induced subgraphs of Ramsey graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552509)
