On some generalized vertex Folkman numbers

DOI10.1007/s00373-023-02654-8zbMath1518.05134arXiv2110.03121MaRDI QIDQ6115430

Stanislaw P. Radziszowski, Xiaodong Xu, David E. Narváez, Zohair Raza Hassan, Yunping Jiang

Publication date: 12 July 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

vertex coloringFolkman number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Upper and lower bounds for \(F_v(4,4;5)\)
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• The Ramsey property for graphs with forbidden complete subgraphs
• Small Ramsey numbers
• On the triangle vertex Folkman numbers
• On the nonexistence of some generalized Folkman numbers
• The diamond-free process
• On the Vertex Folkman Numbers $F_v(2,...,2;q)$
• On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
• On the Folkman Numberf(2, 3, 4)
• The Ramsey Property for Families of Graphs Which Exclude a Given Graph
• Computation of the Folkman numberFe(3, 3; 5)
• Small graphs with chromatic number 5: A computer search
• On minimal triangle‐free 6‐chromatic graphs
• Use of MAX-CUT for Ramsey Arrowing of Triangles
• Dynamic concentration of the triangle-free process
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On minimal Folkman graphs
• Colouring graphs with no induced six-vertex path or diamond
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some generalized vertex Folkman numbers