A rainbow version of Mantel's Theorem

DOI10.19086/aic.12043zbMath1450.05021arXiv1812.11872OpenAlexW3007681597WikidataQ105342560 ScholiaQ105342560MaRDI QIDQ5126753

Sebastián González Hermosillo de la Maza, Ron Aharoni, Matt DeVos, Amanda Montejano, Robert Šámal

Publication date: 20 October 2020

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.11872

zbMATH Keywords

trianglerainbowextremal graph theoryMantel's theorem

Mathematics Subject Classification ID

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

Related Items (15)

On a colored Turán problem of Diwan and Mubayi ⋮ Transversals and bipancyclicity in bipartite graph families ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ On a rainbow extremal problem for color‐critical graphs ⋮ Rainbow Saturation for Complete Graphs ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ Graphs without a Rainbow Path of Length 3 ⋮ Extremal results for graphs avoiding a rainbow subgraph ⋮ On a rainbow version of Dirac's theorem ⋮ Rainbow pancyclicity in graph systems ⋮ From one to many rainbow Hamiltonian cycles ⋮ Transversal factors and spanning trees ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs

This page was built for publication: A rainbow version of Mantel's Theorem