Ramsey theory and chromatic numbers

DOI10.2140/PJM.1974.55.39zbMATH Open0284.05107OpenAlexW1991258831MaRDI QIDQ1844684FDOQ1844684

Authors: Gary Chartrand, Albert D. Polimeni 

Publication date: 1974

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1974.55.39

Mathematics Subject Classification ID

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

Cited In (7)

• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• Ramsey theory for graph connectivity
• A ramsey-theoretic result involving chromatic numbers
• Chromatic numbers of hypergraphs and coverings of graphs
• Title not available (Why is that?)
• Mixed ramsey numbers: Chromatic numbers versus graphs
• Bounds on chromatic numbers of multiple factors of a complete graph

This page was built for publication: Ramsey theory and chromatic numbers

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