Generalized local colorings of graphs

DOI10.1016/0095-8956(92)90049-4zbMath0769.05041OpenAlexW1989935425MaRDI QIDQ1193560

Miroslaw Truszczynski

Publication date: 27 September 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90049-4

zbMATH Keywords

Ramsey theoryRamsey theoremcolorings

Mathematics Subject Classification ID

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

Related Items (8)

A note on local colorings of graphs ⋮ Ramsey and 2-local Ramsey numbers for disjoint unions of cycles ⋮ Relations between 2-local and 2-mean Ramsey numbers for graphs ⋮ Local Ramsey numbers for copies of cycles ⋮ Monochromatic partitions in local edge colorings ⋮ Constrained Ramsey numbers for rainbow matching ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Local Ramsey numbers for some graphs

Cites Work

• Linear upper bounds for local Ramsey numbers
• Ramsey numbers for local colorings
• Local \(k\)-colorings of graphs and hypergraphs
• The Ramsey property for graphs with forbidden complete subgraphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized local colorings of graphs