Anti-Ramsey numbers of doubly edge-critical graphs

DOI10.1002/jgt.20380zbMath1197.05093OpenAlexW4229929591MaRDI QIDQ3652531

Tao Jiang, Oleg Pikhurko

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20380

zbMATH Keywords

stabilityanti-Ramsey numberrainbow subgraphTuran numberpolychromatic subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (6)

Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Planar anti-Ramsey numbers of matchings ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ An analytic approach to stability ⋮ Planar anti-Ramsey numbers of paths and cycles

Cites Work

• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete graphs that avoid polychromatic trees
• Anti-Ramsey numbers of subdivided graphs
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• On totally multicolored stars
• An anti-Ramsey theorem
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-Ramsey numbers of doubly edge-critical graphs