Constrained Ramsey numbers of graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- An anti-Ramsey condition on trees
- Two-edge colorings of graphs with bounded degree in both colors
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Some rainbow cycles in \(r\)-good edge-colorings
- Bounds for bipartite rainbow Ramsey numbers
- Constrained Ramsey numbers for rainbow matching
- Rainbow faces in edge-colored plane graphs
- On an anti-Ramsey threshold for random graphs
- scientific article; zbMATH DE number 2148774 (Why is no real title available?)
- An Upper Bound for Constrained Ramsey Numbers
- Orientable edge colorings of graphs
- Rainbow decompositions
- Constrained Ramsey Numbers
- Constrained Ramsey numbers
- Rainbow generalizations of Ramsey theory: A survey
- Properly edge-coloured subgraphs in colourings of bounded degree
- Improved bounds for proper rainbow saturation
- Canonical theorems in geometric Ramsey theory
- Canonical Ramsey numbers of sparse graphs
- A heuristic algorithm for rainbow matchings and its application in rainbow Ramsey number for matchings
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Edge-colorings avoiding rainbow and monochromatic subgraphs
This page was built for publication: Constrained Ramsey numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798124)
