Size and degree anti-Ramsey numbers

DOI10.1007/S00373-015-1583-9zbMATHOpenAlexMaRDI QIDQ897241FDO

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

zbMATH Keywords

anti-Ramseyrainbow subgraphproper edge coloring

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 426321 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• An anti-Ramsey theorem
• Online and size anti-Ramsey numbers
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

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)