scientific article

zbMath0547.05030MaRDI QIDQ3338272

Nedyalko Dimov Nenov

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic numbercomplete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Unnamed Item ⋮ On some edge Folkman numbers, small and large ⋮ On the triangle vertex Folkman numbers ⋮ Partitioning graphs into complete and empty graphs ⋮ On the small graphs with chromatic number 5 without 4-cliques ⋮ The size of a minimum five-chromatic \(K_ 4\)-free graph ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$

This page was built for publication: