Multicolour Turán problems

DOI10.1016/j.aam.2003.08.005zbMath1056.05080OpenAlexW2117407892MaRDI QIDQ1883379

Peter Keevash, Michael E. Saks, Benjamin Sudakov, Jacques Verstraete

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2003.08.005

zbMATH Keywords

extremal problemsrainbow colouring

Mathematics Subject Classification ID

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

Related Items (11)

A remark on the number of edge colorings of graphs ⋮ Multicolor Turán numbers ⋮ A rainbow Erdős-Rothschild problem ⋮ Multicolour Sunflowers ⋮ On a rainbow extremal problem for color‐critical graphs ⋮ A Rainbow Erdös--Rothschild Problem ⋮ Rainbow Saturation for Complete Graphs ⋮ Localized versions of extremal problems ⋮ Turán numbers of several bipartite graphs ⋮ Graphs without a Rainbow Path of Length 3 ⋮ Extremal results for graphs avoiding a rainbow subgraph

Cites Work

• Unnamed Item
• Unnamed Item
• Norm-graphs: Variations and applications
• Graphs without quadrilaterals
• On the number of edges of quadrilateral-free graphs
• Norm-graphs and bipartite Turán numbers
• Turán problems for integer-weighted graphs
• An Upper Bound on Zarankiewicz' Problem
• On a problem of K. Zarankiewicz
• On the theory of graphs

This page was built for publication: Multicolour Turán problems