Size and degree anti-Ramsey numbers

DOI10.1007/S00373-015-1583-9zbMATH Open1327.05224OpenAlexW650914769MaRDI QIDQ897241FDOQ897241

Authors: Noga Alon 

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1583-9

Recommendations

• On degree anti-Ramsey numbers
• Online and size anti-Ramsey numbers
• Anti-Ramsey numbers of minimal graphs
• Rainbow triangles in edge-colored Kneser graphs
• Anti-Ramsey problems for cycles

zbMATH Keywords

anti-Ramseyrainbow subgraphproper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Online and size anti-Ramsey numbers
• Title not available (Why is that?)
• An anti-Ramsey theorem

Cited In (2)

• Online and size anti-Ramsey numbers
• On degree anti-Ramsey numbers

This page was built for publication: Size and degree anti-Ramsey numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897241)