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

DOI10.1016/S0021-9800(68)80009-2zbMath0153.54102MaRDI QIDQ5533016

Ronald L. Graham

Publication date: 1968

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

zbMATH Keywords

topology

Related Items

Large triangle-free subgraphs in graphs without \(K_ 4\), A Folkman Linear Family, Small minimal $(3, 3)$-Ramsey graphs, Some recent results on Ramsey-type numbers, Finding Folkman Numbers via MAX CUT Problem, Unnamed Item, An exponential-type upper bound for Folkman numbers, \(p\)-arrangeable graphs are Folkman linear, Sur les R-coloriages minimaux, Unnamed Item, 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 Some Open Questions for Ramsey and Folkman Numbers, On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$