Monochromatic triangles in three-coloured graphs
DOI10.1016/J.JCTB.2013.05.002zbMATH Open1301.05121arXiv1206.1987OpenAlexW2137250886WikidataQ57601355 ScholiaQ57601355MaRDI QIDQ463289FDOQ463289
Authors: James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young 
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
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Cites Work
- CSDP, A C library for semidefinite programming
- Title not available (Why is that?)
- Non-three-colourable common graphs exist
- On 3-hypergraphs with forbidden 4-vertex configurations
- Flag algebras
- Title not available (Why is that?)
- Combinatorial Relations and Chromatic Graphs
- On Sets of Acquaintances and Strangers at any Party
- Multiplicities of subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicity of complete graphs
- 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
- Monochromatic triangles in three colours
- On the Ramsey multiplicities of graphs—problems and recent results
- Title not available (Why is that?)
- Monochromatic triangles in three-coloured graphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Graphs containing triangles are not 3-common
Cited In (35)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- On the maximum density of fixed strongly connected subtournaments
- Non-monochromatic triangles in a 2-edge-coloured graph
- Monochromatic triangles in three colours
- Title not available (Why is that?)
- Decomposing graphs into edges and triangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Off-diagonal commonality of graphs via entropy
- C5 ${C}_{5}$ is almost a fractalizer
- Edges not in any monochromatic copy of a fixed graph
- On multiplicity of triangles
- Minimum number of edges that occur in odd cycles
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Monochromatic equilateral triangles in the unit distance graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monochromatic triangles in three-coloured graphs
- Monochromatic triangles in two-colored plane
- Bounding monochromatic triangles using squares
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
- Anti-Ramsey Multiplicities
- Frustrated triangles
- Triangles in a complete chromatic graph with three colors
- Using Ramsey theory to measure unavoidable spurious correlations in big data
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Inducibility of directed paths
- Monochromatic Paths and Triangulated Graphs
- Rainbow triangles in three-colored graphs
- On edges not in monochromatic copies of a fixed bipartite graph
- Asymptotic structure of graphs with the minimum number of triangles
- Semidefinite programming and Ramsey numbers
- Extremal problems and results related to Gallai-colorings
- Compactness and finite forcibility of graphons
Uses Software
This page was built for publication: Monochromatic triangles in three-coloured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463289)
