The Erdős-Hajnal conjecture for rainbow triangles
From MaRDI portal
Publication:2259857
DOI10.1016/j.jctb.2014.09.005zbMath1307.05069arXiv1303.2951MaRDI QIDQ2259857
Andrey Grinshpun, János Pach, Jacob Fox
Publication date: 5 March 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.2951
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
05C22: Signed and weighted graphs
Related Items
Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$, Constructive Methods in Gallai-Ramsey Theory for Hypergraphs, The Typical Structure of Gallai Colorings and Their Extremal Graphs, A conjecture on Gallai-Ramsey numbers of even cycles and paths, Gallai-Ramsey numbers for graphs with five vertices of chromatic number four, Gallai–Ramsey number for K5 ${K}_{5}$, The Erdős–Gyárfás function with respect to Gallai‐colorings, Sturm bounds for Siegel modular forms, The number of Gallai \(k\)-colorings of complete graphs, All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs, Gallai-Ramsey numbers of \(C_7\) with multiple colors, Extremal problems and results related to Gallai-colorings, Non-monochromatic triangles in a 2-edge-coloured graph, Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings, Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs, Rainbow triangles in arc-colored tournaments, Gallai-Ramsey number of even cycles with chords, Gallai-Ramsey number of odd cycles with chords, Disproof of a conjecture on the rainbow triangles in arc-colored digraphs, Ramsey and Gallai-Ramsey numbers for the union of paths and stars, The Erdős-Hajnal conjecture for three colors and triangles, Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths, Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs, Gallai-Ramsey numbers for graphs with chromatic number three, Gallai-Ramsey numbers for books, A note on Gallai-Ramsey number of even wheels, Complete graphs and complete bipartite graphs without rainbow path, Unnamed Item
Cites Work
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey-type theorems
- Edge-colored complete graphs with precisely colored subgraphs
- The Erdős-Hajnal conjecture for bull-free graphs
- Gallai colorings of non-complete graphs
- Density theorems for bipartite graphs and related Ramsey-type results
- A note on perfect graphs
- On a property of the class of n-colorable graphs
- The Erdös-Hajnal Conjecture-A Survey
- Ramsey-type results for Gallai colorings
- Rainbow Ramsey theorems for colorings establishing negative partition relations
- Transitiv orientierbare Graphen
- Some remarks on the theory of graphs
- Graph pairs and their entropies: Modularity problems
- Ramsey-type theorems with forbidden subgraphs
