Set-coloring of edges and multigraph Ramsey numbers
From MaRDI portal
Publication:968224
DOI10.1007/S00373-010-0888-YzbMATH Open1205.05158OpenAlexW1970497402MaRDI QIDQ968224FDOQ968224
Authors: Xiaodong Xu, Zehui Shao, Wenlong Su, Zhenchong Li
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
Recommendations
Cites Work
Cited In (13)
- On multiset colorings of graphs
- Multicolor Ramsey numbers via pseudorandom graphs
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
- Tower Gaps in Multicolour Ramsey Numbers
- An anti-Ramsey Theorem on edge-cutsets
- On the multicolor Ramsey number of a graph with \(m\) edges
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- General properties of some graphs defined by systems of equations
- General properties of some families of graphs defined by systems of equations
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- A lower bound for set‐coloring Ramsey numbers
- Title not available (Why is that?)
This page was built for publication: Set-coloring of edges and multigraph Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968224)