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

DOI10.1002/JGT.3190170604zbMath0791.05039OpenAlexW2005432760MaRDI QIDQ4285589

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

zbMATH Keywords

boundcoloringminimum numberFolkman number

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

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