Directed graphs without rainbow stars

DOI10.37236/12784MaRDI QIDQ6671602zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.37236/12784

zbMATH Keywords

directed starTurán problem

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(1)

• Directed graphs without rainbow triangles

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)