On a bound of Graham and Spencer for a graph-colouring constant

DOI10.1016/0095-8956(73)90021-XzbMATH Open0247.05119OpenAlexW2000639038MaRDI QIDQ2555862FDOQ2555862

Authors: Robert W. Irving 

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90021-x

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Construction of Certain Graphs
• Combinatorial Relations and Chromatic Graphs
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• Title not available (Why is that?)

Cited In (6)

• Sur les R-coloriages minimaux
• A Folkman linear family
• \(p\)-arrangeable graphs are Folkman linear
• Title not available (Why is that?)
• 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

This page was built for publication: On a bound of Graham and Spencer for a graph-colouring constant

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