Minimum-degree conditions for rainbow triangles

DOI10.1002/JGT.23109zbMATH Open1547.05094MaRDI QIDQ6606322FDOQ6606322

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)

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

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)

Cites Work

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

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)