scientific article; zbMATH DE number 1835112

zbMATH Open1003.05038MaRDI QIDQ4779334FDOQ4779334

Authors: Nedyalko Nenov 

Publication date: 28 November 2002

Title of this publication is not available (Why is that?)

Recommendations

• New upper bound for a class of vertex Folkman numbers
• scientific article; zbMATH DE number 1969588
• 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)\).

zbMATH Keywords

coloring of graphsvertex Folkman number

Mathematics Subject Classification ID

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

Cited In (11)

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

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)