Rainbow cliques in edge-colored graphs

DOI10.1016/J.EJC.2015.12.013zbMath1331.05091OpenAlexW2280786895MaRDI QIDQ5964266

Sheng Gui Zhang, Wei Fan Wang, Xiaoxue Hu, Chuan-Dong Xu

Publication date: 29 February 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.12.013

zbMATH Keywords

Turán numberrainbow number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ On sufficient conditions for rainbow cycles in edge-colored graphs ⋮ Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Rainbow triangles and cliques in edge-colored graphs

Cites Work

• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Rainbow numbers for matchings and complete graphs
• Rainbow triangles in edge-colored graphs
• An anti-Ramsey theorem

This page was built for publication: Rainbow cliques in edge-colored graphs