Edge-colorings avoiding rainbow and monochromatic subgraphs
type: Item
instance of: scholarly article
title: Edge-colorings avoiding rainbow and monochromatic subgraphs
zbMATH Open document ID: 1235.05092
author: Perry Iverson
author: Maria Axenovich
published in: Discrete Mathematics
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5321343
zbMATH Keywords: mixed Ramsey
zbMATH Keywords: edge-coloring
zbMATH Keywords: monochromatic
zbMATH Keywords: totally multicolored
MaRDI profile type: Publication
full work available at URL: j.disc.2007.08.092
OpenAlex ID: W1966073846
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q3113191
cites work: On generalized Ramsey theory: The bipartite case
cites work: Canonical pattern Ramsey numbers
cites work: On a generalized anti-Ramsey problem
cites work: An anti-Ramsey theorem
cites work: Q3852212
cites work: Edge-colored complete graphs with precisely colored subgraphs
cites work: A survey of bounds for classical Ramsey numbers
cites work: Q4284611
cites work: A variant of the classical Ramsey problem
cites work: A Combinatorial Theorem
cites work: Q4075490
cites work: On the structure of linear graphs
cites work: Transitiv orientierbare Graphen
cites work: Edge colorings of complete graphs without tricolored triangles
cites work: Constrained Ramsey numbers of graphs
cites work: On pattern Ramsey numbers of graphs
cites work: On a problem of K. Zarankiewicz
cites work: On Erdős-Rado numbers
cites work: An anti-Ramsey theorem on cycles
cites work: An explicit construction for a Ramsey problem
cites work: Q4869540
DOI: 10.1016/J.DISC.2007.08.092
description: scientific article; zbMATH DE number 5321343