Ramsey problems and their connection to tuŕan-type extremal problems

DOI10.1002/jgt.3190160105zbMath0770.05075OpenAlexW2068745402MaRDI QIDQ3990872

Ralph J. Faudree, Miklós Simmonovits

Publication date: 28 June 1992

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

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

zbMATH Keywords

treeRamsey numberedge coloringchromatic numberdecomposition class

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (3)

A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Generalized and geometric Ramsey numbers for cycles.

Cites Work

• Unnamed Item
• Margulis
• Graph Theory and Probability. II

This page was built for publication: Ramsey problems and their connection to tuŕan-type extremal problems