Ramsey graphs induce subgraphs of many different sizes

DOI10.1007/s00493-017-3755-0zbMath1438.05237arXiv1609.01705OpenAlexW2963698294MaRDI QIDQ2416519

Julian Sahasrabudhe, István Tomon, Bhargav P. Narayanan

Publication date: 23 May 2019

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphRamsey graphs\(C\)-Ramsey graph

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Distinct degrees in induced subgraphs ⋮ 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

This page was built for publication: Ramsey graphs induce subgraphs of many different sizes