Maximal antiramsey graphs and the strong chromatic number

DOI10.1002/jgt.3190130302zbMath0682.05046OpenAlexW2114211390WikidataQ106009387 ScholiaQ106009387MaRDI QIDQ4731212

Vera T. Sós, Stefan A. Burr, Ronald L. Graham, Paul Erdős

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1002/jgt.3190130302

zbMATH Keywords

extremal anti-Ramsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

Rainbow generalizations of Ramsey theory: A survey, Rainbow subgraphs in edge-colored planar and outerplanar graphs, A new proof of the graph removal lemma, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Generalized Ramsey numbers: forbidding paths with few colors

Cites Work

• Unnamed Item