Minimum-degree conditions for rainbow triangles

DOI10.1002/JGT.23109MaRDI QIDQ6606322zbMATHFDO

Authors Victor Falgas-Ravry, Klas Markström, Eero Räty

Publication date 16 September 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

extremal graph theoryrainbow trianglesMantel's theoremGallai colouringsmin degree

Mathematics Subject Classification ID

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

Recommendations

• Note on rainbow triangles in edge-colored graphs
• Color degree sum conditions for rainbow triangles in edge-colored graphs
• Counting rainbow triangles in edge-colored graphs
• Rainbow triangles in edge-colored graphs
• Vertex-disjoint rainbow triangles in edge-colored graphs

Cites work

• scientific article; zbMATH DE number 434896 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A general approach to transversal versions of Dirac‐type theorems
• A rainbow version of Mantel's theorem
• Edge colorings of complete graphs without tricolored triangles
• Extremal results for graphs avoiding a rainbow subgraph
• Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
• Lambda composition
• Multicolour Turán problems
• On a rainbow version of Dirac's theorem
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Rainbow triangles and the Caccetta-Häggkvist conjecture
• Transitiv orientierbare Graphen
• Vraagstuk XXVIII.

This page was built for publication: Minimum-degree conditions for rainbow triangles

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