Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$

zbMath1474.05124arXiv1711.01535MaRDI QIDQ4994199

Aleksandar Bikov, Nedyalko Dimov Nenov

Publication date: 17 June 2021

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

zbMATH Keywords

independence numberchromatic numberclique numberFolkman number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Chromatic vertex Folkman numbers

Cites Work

• Upper and lower bounds for \(F_v(4,4;5)\)
• New upper bound for a class of vertex Folkman numbers
• A note on restricted vertex Ramsey numbers
• Practical graph isomorphism. II.
• Computation of the Folkman numberFe(3, 3; 5)
• The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
• New Upper Bound on Vertex Folkman Numbers
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On minimal Folkman graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$