Local \(k\)-colorings of graphs and hypergraphs

DOI10.1016/0095-8956(87)90017-7zbMath0632.05041OpenAlexW2056006353MaRDI QIDQ1095156

B. George

Publication date: 1987

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(87)90017-7

zbMATH Keywords

edge-coloringRamsey theorybipartite graphschromatic numberinduced subgraphmonochromatic copylocal k-coloring

Mathematics Subject Classification ID

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

Related Items (19)

My Friend and Colleague, Richard Schelp ⋮ 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 ⋮ Zero-sum problems -- a survey ⋮ Hypergraph coverings and local colorings ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Size of monochromatic components in local edge colorings ⋮ Local Ramsey numbers for copies of cycles ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Bipartite rainbow Ramsey numbers. ⋮ 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 ⋮ Some rainbow cycles in \(r\)-good edge-colorings ⋮ 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
• Coloring graphs with locally few colors
• Ramsey numbers for local colorings
• The Ramsey property for graphs with forbidden complete subgraphs
• The size Ramsey number
• Two proofs of the Ramsey property of the class of finite hypergraphs
• Monochromatic paths in edge-colored graphs
• A Ramsey-type problem in directed and bipartite graphs
• The structure of critical Ramsey graphs
• The biparticity of a graph
• On size Ramsey number of paths, trees, and circuits. I
• Nombre chromatique et plus longs chemins d'un graphe
• Even edge colorings of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local \(k\)-colorings of graphs and hypergraphs