An upper bound for the Folkman number F(3, 3; 5)

DOI10.1002/JGT.3190170604zbMATH Open0791.05039OpenAlexW2005432760MaRDI QIDQ4285589FDOQ4285589

Authors: Martin J. Erickson 

Publication date: 24 March 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170604

Recommendations

• scientific article; zbMATH DE number 706775
• Upper bounds for the vertex Folkman number \(F_v(3,3,3;4)\) and \(F_v(3,3,3;5)\).
• Computation of the Folkman numberFe(3, 3; 5)
• Upper bound on the edge Folkman number \( F_{e}(3,3,3;13) \)
• New upper bounds for vertex Folkman numbers \(F_v(3,k;k+1)\)
• scientific article; zbMATH DE number 2237375
• New Upper Bound for the Edge Folkman Number Fe(3,5;13)
• A note on upper bounds for some generalized Folkman numbers
• On the Folkman Numberf(2, 3, 4)
• Computation of the Folkman number \(F_v (3, 5; 6)\)

zbMATH Keywords

boundcoloringminimum numberFolkman number

Mathematics Subject Classification ID

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

Cited In (14)

• An improved lower bound for Folkman's theorem
• Computation of the Folkman number \(F_v (3, 5; 6)\)
• A Folkman linear family
• \(p\)-arrangeable graphs are Folkman linear
• Title not available (Why is that?)
• A note on upper bounds for some generalized Folkman numbers
• Upper bound on the edge Folkman number \( F_{e}(3,3,3;13) \)
• Title not available (Why is that?)
• On the Folkman Numberf(2, 3, 4)
• Computation of the Folkman numberFe(3, 3; 5)
• On generalized Folkman numbers
• On induced Folkman numbers
• Upper bounds for the vertex Folkman number \(F_v(3,3,3;4)\) and \(F_v(3,3,3;5)\).
• The edge Folkman number $F_e(3, 3; 4)$ is greater than 19

This page was built for publication: An upper bound for the Folkman number F(3, 3; 5)

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