Edge-colorings avoiding rainbow and monochromatic subgraphs
From MaRDI portal
Publication:942100
DOI10.1016/j.disc.2007.08.092zbMath1235.05092OpenAlexW1966073846MaRDI QIDQ942100
Perry Iverson, Maria A. Axenovich
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.092
Related Items (10)
On colorful edge triples in edge-colored complete graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs ⋮ Gallai-Ramsey numbers for monochromatic triangles or 4-cycles ⋮ Gallai-Ramsey numbers for cycles ⋮ Gallai-Ramsey numbers for books ⋮ A note on the monotonicity of mixed Ramsey numbers ⋮ Worm colorings ⋮ Gallai-Ramsey number of an 8-cycle ⋮ Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On pattern Ramsey numbers of graphs
- An explicit construction for a Ramsey problem
- Edge-colored complete graphs with precisely colored subgraphs
- A variant of the classical Ramsey problem
- On Erdős-Rado numbers
- On generalized Ramsey theory: The bipartite case
- Canonical pattern Ramsey numbers
- An anti-Ramsey theorem on cycles
- Edge colorings of complete graphs without tricolored triangles
- A survey of bounds for classical Ramsey numbers
- Constrained Ramsey numbers of graphs
- Transitiv orientierbare Graphen
- A Combinatorial Theorem
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- An anti-Ramsey theorem
- An anti-Ramsey theorem
- On a generalized anti-Ramsey problem
This page was built for publication: Edge-colorings avoiding rainbow and monochromatic subgraphs
