An anti-Ramsey theorem

DOI10.1007/BF02582925zbMath0581.05040OpenAlexW2097022377MaRDI QIDQ5902976

László Babai

Publication date: 1985

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

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

zbMATH Keywords

greedy algorithmedge-coloringsantihomogeneous subsets of the complete graphSidon sets in groups

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items

\((k,\lambda)\)-anti-powers and other patterns in words, On degree anti-Ramsey numbers, Rainbow spanning trees in abelian groups, On an anti‐Ramsey property of Ramanujan graphs, How many colors guarantee a rainbow matching?, Size and degree anti-Ramsey numbers, Extremal Results for Berge Hypergraphs, Symmetrized induced Ramsey theory, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On a heterochromatic number for hypercubes, A General Framework for Studying Finite Rainbow Configurations, Edge-colorings avoiding rainbow and monochromatic subgraphs, Anti-Ramsey theory on complete bipartite graphs, On the independence number of non-uniform uncrowded hypergraphs, Canonical Ramsey numbers and properly colored cycles, On Erdős-Rado numbers, Unordered canonical Ramsey numbers, Sidon sets in groups and induced subgraphs of Cayley graphs

Cites Work

• On restricted colourings of \(K_ n\)
• Sidon sets in groups and induced subgraphs of Cayley graphs
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems