Two problems in graph Ramsey theory

DOI10.1016/J.EJC.2022.103552zbMath1490.05177arXiv2008.07367OpenAlexW3049643044MaRDI QIDQ2143416

Yanyan Li

Publication date: 31 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberssaturation problems in Ramsey theory

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• On the minimum degree of minimal Ramsey graphs for multiple colours
• On generalized Ramsey numbers of Erdős and Rogers
• The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
• The typical structure of graphs with no large cliques
• A new upper bound for diagonal Ramsey numbers
• Ramsey's theorem - a new lower bound
• Saturation problems in the Ramsey theory of graphs, posets and point sets
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• Ramsey numbers of Berge-hypergraphs and related structures
• On a generalization of Ramsey numbers
• An efficient container lemma
• Ramsey Problems for Berge Hypergraphs
• Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
• Some remarks on the theory of graphs

This page was built for publication: Two problems in graph Ramsey theory