Induced subgraphs of Ramsey graphs with many distinct degrees
From MaRDI portal
Publication:885296
DOI10.1016/j.jctb.2006.09.006zbMath1120.05057OpenAlexW2147229463MaRDI QIDQ885296
Publication date: 8 June 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.09.006
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (11)
Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A bipartite version of the Erdős–McKay conjecture ⋮ Distinct degrees and homogeneous sets ⋮ Induced Subgraphs With Many Distinct Degrees ⋮ Distinct degrees in induced subgraphs ⋮ Sizes of Induced Subgraphs of Ramsey Graphs ⋮ Induced Ramsey-type theorems ⋮ Induced subgraphs with distinct sizes ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey-type theorems
- Ramsey graphs contain many distinct induced subgraphs
- On the number of distinct induced subgraphs of a graph
- Erdős and Rényi conjecture
- Some recent problems and results in graph theory
- Non-Ramsey graphs are \(c\log n\)-universal
- Graphs with a small number of distinct induced subgraphs
- Random regular tournaments
- On a Ramsey type theorem
- Some extremal properties concerning transitivity in graphs
- On Subgraph Sizes in Random Graphs
- Induced subgraphs of prescribed size
- Some remarks on the theory of graphs
This page was built for publication: Induced subgraphs of Ramsey graphs with many distinct degrees