A note on upper bounds for some generalized Folkman numbers

DOI10.7151/dmgt.2120zbMath1415.05116arXiv1708.00125OpenAlexW2963023730MaRDI QIDQ2312073

Meilian Liang, Xiaodong Xu, Stanislaw P. Radziszowski

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberFolkman number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

On some edge Folkman numbers, small and large

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized Ramsey numbers of Erdős and Rogers
• On generalized Folkman numbers
• Upper and lower bounds for \(F_v(4,4;5)\)
• An exponential-type upper bound for Folkman numbers
• A multiplicative inequality for vertex Folkman numbers
• The Ramsey property for graphs with forbidden complete subgraphs
• On the nonexistence of some generalized Folkman numbers
• Chromatic vertex Folkman numbers
• A Folkman Linear Family
• Computation of the Folkman numberFe(3, 3; 5)
• The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: A note on upper bounds for some generalized Folkman numbers