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

DOI10.1016/S0021-9800(68)80009-2zbMATH Open0153.54102MaRDI QIDQ5533016FDOQ5533016

Authors: Ron Graham 

Publication date: 1968

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

zbMATH Keywords

topology

Cited In (15)

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

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)