Rainbow Turán problem for even cycles

DOI10.1016/j.ejc.2013.01.003zbMath1260.05079arXiv1202.3221OpenAlexW2149918285MaRDI QIDQ1943398

Choongbum Lee, Shagnik Das, Benjamin Sudakov

Publication date: 19 March 2013

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

Full work available at URL: https://arxiv.org/abs/1202.3221

zbMATH Keywords

edge-colored graphrainbow Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ The Generalized Rainbow Turán Problem for Cycles ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ Small Dense Subgraphs of a Graph ⋮ A Rainbow Erdös--Rothschild Problem ⋮ Rainbow clique subdivisions ⋮ Rainbow cycles vs. rainbow paths ⋮ Graphs without a Rainbow Path of Length 3 ⋮ On the Turán number of the hypercube ⋮ Rainbow subdivisions of cliques ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Rainbow Turán number of clique subdivisions ⋮ Unnamed Item ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On the rainbow Turán number of paths ⋮ Rainbow Turán problems for paths and forests of stars ⋮ Some rainbow cycles in \(r\)-good edge-colorings ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Ramsey Numbers for Nontrivial Berge Cycles

This page was built for publication: Rainbow Turán problem for even cycles