New Upper Bound for the Edge Folkman Number Fe(3,5;13)

MaRDI QIDQ3000736zbMATH OpenFDO

Authors

Publication date 30 May 2011

Full work available at URL https://arxiv.org/abs/0806.1403

zbMATH Keywords

Folkman graphFolkman number

Mathematics Subject Classification ID

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

Abstract: In this paper we prove that the edge Folkman number Fe(3,5;13) is not greater than 21.

Recommendations

• Folkman number \(F_e(3,4;8)\) is equal to 16
• Upper bound on the edge Folkman number \( F_{e}(3,3,3;13) \)
• Bounds on some edge Folkman numbers
• Computation of the vertex Folkman numbers \(F(2,2,2,4;6)\) and \(F(2,3,4;6)\)
• An example of a 16-vertex Folkman edge \((3,4)\)-graph without 8-cliques
• On some edge Folkman numbers, small and large
• On some open questions for Ramsey and Folkman numbers
• scientific article; zbMATH DE number 706775
• On the 3-colouring vertex Folkman number \(F(2,2,4)\)
• On the lower bound for \(F_v(k,k;k+1)\) and \(F_e(3,4;5)\)

Cited in

(8)

• The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
• On some open questions for Ramsey and Folkman numbers
• An upper bound for the Folkman number F(3, 3; 5)
• Folkman number \(F_e(3,4;8)\) is equal to 16
• Upper bound on the edge Folkman number \( F_{e}(3,3,3;13) \)
• An example of a 16-vertex Folkman edge \((3,4)\)-graph without 8-cliques
• scientific article; zbMATH DE number 706775 (Why is no real title available?)
• Bounds on some edge Folkman numbers

This page was built for publication: New Upper Bound for the Edge Folkman Number Fe(3,5;13)

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