Set-coloring of edges and multigraph Ramsey numbers

DOI10.1007/s00373-010-0888-yzbMath1205.05158OpenAlexW1970497402MaRDI QIDQ968224

Zehui Shao, Xiaodong Xu, Zhenchong Li, Wenlong Su

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0888-y

zbMATH Keywords

multigraphRamsey numberboundset-coloringmultigraph Ramsey number

Mathematics Subject Classification ID

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

Related Items

Monochromatic tree covers and Ramsey numbers for set-coloured graphs ⋮ Tower Gaps in Multicolour Ramsey Numbers ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

Cites Work

• Unnamed Item
• Lower bounds of Ramsey numbers based on cubic residues
• A refinement of Vizing's theorem
• Set colourings of graphs. (Reprint)
• A Ramsey‐type problem and the Turán numbers*