Graphs without a rainbow path of length 3 (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-011MaRDI QIDQ7000367zbMATH OpenFDO

Authors Sebastian Babiński, A. Grzesik

Publication date 8 April 2025

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-011

zbMATH Keywords

asymptotically optimal boundmaximum number of edges

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites work

• A new proof of the graph removal lemma
• A rainbow version of Mantel's theorem
• Density of Gallai multigraphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Multicolour Turán problems
• Non-monochromatic triangles in a 2-edge-coloured graph
• On a colored Turán problem of Diwan and Mubayi
• On maximal paths and circuits of graphs
• On the structure of linear graphs
• Path Ramsey numbers in multicolorings
• Vraagstuk XXVIII.

This page was built for publication: Graphs without a rainbow path of length 3 (extended abstract)

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