Linear upper bounds for local Ramsey numbers

DOI10.1007/BF01788530zbMath0612.05045OpenAlexW1970015445MaRDI QIDQ1087887

Zsolt Tuza, Miroslaw Truszczynski

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788530

zbMATH Keywords

Ramsey numberlocal k-coloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items

A note on local colorings of graphs ⋮ Monochromatic Cycle Partitions in Local Edge Colorings ⋮ Ramsey and 2-local Ramsey numbers for disjoint unions of cycles ⋮ Relations between 2-local and 2-mean Ramsey numbers for graphs ⋮ Zero-sum problems -- a survey ⋮ Hypergraph coverings and local colorings ⋮ Local Ramsey numbers for copies of cycles ⋮ Monochromatic partitions in local edge colorings ⋮ Generalized local colorings of graphs ⋮ Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Local Ramsey numbers for some graphs ⋮ Constrained Ramsey Numbers ⋮ Local and mean Ramsey numbers for trees

Cites Work

• The Ramsey number of a graph with bounded maximum degree
• Ramsey numbers for local colorings
• On coloring graphs to maximize the proportion of multicolored k-edges