On the use of senders in generalized Ramsey theory for graphs

DOI10.1016/0012-365X(85)90057-3zbMath0564.05040OpenAlexW2030696417MaRDI QIDQ1057876

Jaroslav Nešetřil, Vojtěch Rödl, Stefan A. Burr

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90057-3

zbMATH Keywords

senders

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite ⋮ Blowup Ramsey numbers ⋮ Graph Ramsey theory and the polynomial hierarchy ⋮ On highly ramsey infinite graphs ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018 ⋮ Minimal ordered Ramsey graphs ⋮ Some undecidable problems involving the edge-coloring and vertex-coloring of graphs ⋮ Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques

Cites Work

• Ramsey-minimal graphs for star-forests
• Ramsey-minimal graphs for forests
• The Ramsey property for graphs with forbidden complete subgraphs
• Parallel concepts in graph theory
• The structure of critical Ramsey graphs
• Graphs with unique Ramsey colorings
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item