On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon

DOI10.1016/S0021-9800(68)80009-2MaRDI QIDQ5533016zbMATH OpenFDO

Authors Ron Graham

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(68)80009-2

zbMATH Keywords

topology

Cited in

(16)

• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Sur les R-coloriages minimaux
• \(p\)-arrangeable graphs are Folkman linear
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• Sur un problème de Erdős et Hajnal
• On a bound of Graham and Spencer for a graph-colouring constant
• On the independence number of (3, 3)-Ramsey graphs and the Folkman number F_e(3, 3; 4)
• A Folkman linear family
• Finding Folkman Numbers via MAX CUT Problem
• Some recent results on Ramsey-type numbers
• scientific article; zbMATH DE number 706775 (Why is no real title available?)
• Small minimal (3, 3)-Ramsey graphs
• The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
• On some open questions for Ramsey and Folkman numbers
• An exponential-type upper bound for Folkman numbers
• On infinite sequences of minimal graphs containing monochromatic triangles for any edge 2-coloring

This page was built for publication: On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon

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