Large Subgraphs in Rainbow‐Triangle Free Colorings

DOI10.1002/jgt.22117zbMath1370.05073arXiv1612.00471OpenAlexW2963155030MaRDI QIDQ5360880

Adam Zsolt Wagner

Publication date: 26 September 2017

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

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

zbMATH Keywords

Erdős-Szekeres theoremchromatic numberGallai coloringrainbow triangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The length of an s-increasing sequence of r-tuples ⋮ Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs

This page was built for publication: Large Subgraphs in Rainbow‐Triangle Free Colorings