On a generalized anti-Ramsey problem

DOI10.1007/s004930100000zbMath0989.05079OpenAlexW1984911038MaRDI QIDQ5955206

Maria A. Axenovich, André Kündgen

Publication date: 13 February 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930100000

zbMATH Keywords

probabilistic methodanti-Ramsey problemextremal graphRamsey problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Bipartite anti-Ramsey numbers of cycles ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ Complete solution for the rainbow numbers of matchings ⋮ Turán problems for integer-weighted graphs

This page was built for publication: On a generalized anti-Ramsey problem