Monochromatic triangles in three-coloured graphs
From MaRDI portal
Publication:463289
DOI10.1016/j.jctb.2013.05.002zbMath1301.05121arXiv1206.1987OpenAlexW2137250886WikidataQ57601355 ScholiaQ57601355MaRDI QIDQ463289
J. Herrera, D. Rodríguez-Gómez
Publication date: 16 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1987
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (21)
Rainbow triangles in three-colored graphs ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Monochromatic triangles in three-coloured graphs ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Minimum Number ofk-Cliques in Graphs with Bounded Independence Number ⋮ Extremal problems and results related to Gallai-colorings ⋮ On edges not in monochromatic copies of a fixed bipartite graph ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Counting flags in triangle-free digraphs ⋮ Anti-Ramsey Multiplicities ⋮ Frustrated triangles ⋮ Decomposing Graphs into Edges and Triangles ⋮ Using Ramsey theory to measure unavoidable spurious correlations in big data ⋮ Minimum number of edges that occur in odd cycles ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Ramsey multiplicity of complete graphs
- Monochromatic triangles in three-coloured graphs
- Graphs containing triangles are not 3-common
- Triangles in a complete chromatic graph with three colors
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- Graph products and monochromatic multiplicities
- Multiplicities of subgraphs
- Non-Three-Colourable Common Graphs Exist
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Monochromatic triangles in three colours
- On the Ramsey multiplicities of graphs—problems and recent results
- CSDP, A C library for semidefinite programming
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Flag algebras
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: Monochromatic triangles in three-coloured graphs
