Avoiding rainbow 2-connected subgraphs

DOI10.1515/MATH-2017-0035zbMath1362.05086OpenAlexW2607479014MaRDI QIDQ527226

Izolda Gorgol

Publication date: 16 May 2017

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2017-0035

zbMATH Keywords

anti-Ramsey numberextremal edge-colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Anti-Ramsey numbers in complete split graphs
• Rainbow generalizations of Ramsey theory: A survey
• Rainbows in the hypercube
• An anti-Ramsey theorem on cycles
• Bipartite anti-Ramsey numbers of cycles
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle

This page was built for publication: Avoiding rainbow 2-connected subgraphs