scientific article; zbMATH DE number 1835112

MaRDI QIDQ4779334zbMATH OpenFDO

Authors Nedyalko Nenov

Publication date 28 November 2002

zbMATH Keywords

coloring of graphsvertex Folkman number

Mathematics Subject Classification ID

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

Recommendations

• New upper bound for a class of vertex Folkman numbers
• Publication:4422856
• On the Vertex Folkman Numbers $F_v(2,...,2;q)$
• On a class of vertex Folkman graphs
• Upper bounds for the vertex Folkman number \(F_v(3,3,3;4)\) and \(F_v(3,3,3;5)\).

Cited in

(11)

• Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
• Lower bounding the Folkman numbers \(f_v(a_1, \dots, a_s; m - 1)\)
• scientific article; zbMATH DE number 1969588 (Why is no real title available?)
• A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
• A multiplicative inequality for vertex Folkman numbers
• New Upper Bound on Vertex Folkman Numbers
• New upper bound for a class of vertex Folkman numbers
• On a class of vertex Folkman graphs
• Chromatic number of graphs and edge Folkman numbers
• Lower bounds on the vertex-connectivity of digraphs and graphs
• scientific article; zbMATH DE number 2237361 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779334)