Set-coloring of edges and multigraph Ramsey numbers
From MaRDI portal
(Redirected from Publication:968224)
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
- On the multicolor Ramsey number of a graph with m edges
- An anti-Ramsey Theorem on edge-cutsets
- General properties of some graphs defined by systems of equations
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- 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
- scientific article; zbMATH DE number 426345 (Why is no real title available?)
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)