Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs

DOI10.1137/17M1116696zbMath1383.05204OpenAlexW2795915197MaRDI QIDQ5373934

Hiệp Hàn, Tibor Szabó, Vojtěch Rödl

Publication date: 6 April 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1116696

zbMATH Keywords

minimum degreeFolkman numbersRamsey graphminimal Ramsey

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Two problems in graph Ramsey theory ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ Chromatic vertex Folkman numbers ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours

Cites Work

• On the minimum degree of minimal Ramsey graphs for multiple colours
• Spectra of graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• An almost quadratic bound on vertex Folkman numbers
• The Ramsey property for graphs with forbidden complete subgraphs
• Explicit Concentrators from Generalized N-Gons
• A Canonical Ramsey Theorem
• On minimal Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item