scientific article; zbMATH DE number 3769664

zbMATH Open0489.05041MaRDI QIDQ3950583FDOQ3950583

Authors: Nedyalko Nenov 

Publication date: 1981

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

zbMATH Keywords

cliquemonochromatic triangleRamsey graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cited In (8)

• A note on upper bounds for some generalized Folkman numbers
• The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
• On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
• Small minimal \((3, 3)\)-Ramsey graphs
• Lower bounding the Folkman numbers \(f_v(a_1, \dots, a_s; m - 1)\)
• On some generalized vertex Folkman numbers
• On the triangle vertex Folkman numbers
• An exponential-type upper bound for 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 Q3950583)