Computing the Folkman number F_v(2,2,3;4)

zbMATH Open1116.05053MaRDI QIDQ3423988FDOQ3423988

Authors: Jonathan Coles, Stanisław P. Radziszowski 

Publication date: 15 February 2007

Recommendations

• On the vertex Folkman numbers \(F_v(a_1,\dots,a_s;m-1)\) when \(\max\{a_1,\dots,a_s\}=6\) or \(7\)
• Computing the Folkman number \(F_v(2,2,2,2,2;4)\)
• On the 3-colouring vertex Folkman number \(F(2,2,4)\)
• On the Vertex Folkman Numbers $F_v(2,...,2;q)$
• On some generalized vertex Folkman numbers

zbMATH Keywords

algorithmscomputer proof

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cited In (12)

• An almost quadratic bound on vertex Folkman numbers
• Computation of the Folkman number \(F_v (3, 5; 6)\)
• Computing the Folkman number \(F_v(2,2,2,2,2;4)\)
• Computing the van der Waerden number \(W(3,4)=293\)
• On the Folkman Numberf(2, 3, 4)
• Small minimal \((3, 3)\)-Ramsey graphs
• Computation of the vertex Folkman numbers \(F(2,2,2,4;6)\) and \(F(2,3,4;6)\)
• Computation of the Folkman numberFe(3, 3; 5)
• New Upper Bound on Vertex Folkman Numbers
• On the vertex Folkman numbers \(F_v(a_1,\dots,a_s;m-1)\) when \(\max\{a_1,\dots,a_s\}=6\) or \(7\)
• On some generalized vertex Folkman numbers
• Some recent results on Ramsey-type numbers

Uses Software

• nauty

This page was built for publication: Computing the Folkman number \(F_v(2,2,3;4)\)

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