Directed graphs without rainbow stars

DOI10.37236/12784MaRDI QIDQ6671602FDOQ6671602

Authors: Dániel Gerbner, A. Grzesik, Cory Palmer, Magdalena Prorok 

Publication date: 27 January 2025

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Rainbow Turán problems for paths and forests of stars
• Rainbow cycles versus rainbow paths
• Edge-colorings avoiding rainbow stars

zbMATH Keywords

directed starTurán problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cites Work

• Multicolour Turán problems
• A new proof of the graph removal lemma
• A rainbow version of Mantel's theorem
• On a rainbow extremal problem for color‐critical graphs
• Graphs without a Rainbow Path of Length 3
• Extremal results for graphs avoiding a rainbow subgraph
• Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates

This page was built for publication: Directed graphs without rainbow stars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671602)