Erdős and Rényi conjecture

DOI10.1006/jcta.1997.2845zbMath0906.05048arXivmath/9707226OpenAlexW2062833240WikidataQ122908386 ScholiaQ122908386MaRDI QIDQ1268624

Saharon Shelah

Publication date: 1 February 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9707226

zbMATH Keywords

Ramsey theoryinduced subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (14)

Induced subgraphs of Ramsey graphs with many distinct degrees ⋮ Tower Gaps in Multicolour Ramsey Numbers ⋮ 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 ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Non-Ramsey graphs are \(c\log n\)-universal ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs ⋮ Large cliques and independent sets all over the place

Cites Work

• Ramsey graphs contain many distinct induced subgraphs
• On the number of distinct induced subgraphs of a graph
• Graphs with a small number of distinct induced subgraphs
• Some remarks on the theory of graphs
• Unnamed Item

This page was built for publication: Erdős and Rényi conjecture