ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS

DOI10.1093/qmath/44.4.385zbMath0786.05034OpenAlexW1974866794MaRDI QIDQ4277966

Zsolt Tuza, Yair Caro

Publication date: 5 May 1994

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/44.4.385

zbMATH Keywords

hypergraphsRamsey numberscoloringsdensity theorem

Mathematics Subject Classification ID

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

Related Items (9)

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 ⋮ Local Ramsey numbers for copies of cycles ⋮ Monochromatic partitions in local edge colorings ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Local Ramsey numbers for some graphs ⋮ Local and mean Ramsey numbers for trees ⋮ Local and Mean Ramsey Numbers for Some Graphs

This page was built for publication: ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS