Monochromatic triangles in three-coloured graphs
From MaRDI portal
(Redirected from Publication:463289)
Abstract: In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than two colours. In this paper, we determine the minimum number of monochromatic triangles and the colourings which achieve this minimum in a sufficiently large three-coloured complete graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3623586 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- CSDP, A C library for semidefinite programming
- Combinatorial Relations and Chromatic Graphs
- Flag algebras
- Graph products and monochromatic multiplicities
- Graphs containing triangles are not 3-common
- Monochromatic triangles in three colours
- Monochromatic triangles in three-coloured graphs
- 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
- On the Ramsey multiplicities of graphs—problems and recent results
- On the Ramsey multiplicity of complete graphs
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Triangles in a complete chromatic graph with three colors
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
- scientific article; zbMATH DE number 4023316 (Why is no real title available?)
- Decomposing graphs into edges and triangles
- scientific article; zbMATH DE number 5194460 (Why is no real title available?)
- scientific article; zbMATH DE number 3885935 (Why is no real title available?)
- Edges not in any monochromatic copy of a fixed graph
- Off-diagonal commonality of graphs via entropy
- C5 ${C}_{5}$ is almost a fractalizer
- 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 triangles in three-coloured graphs
- Monochromatic equilateral triangles in the unit distance graph
- scientific article; zbMATH DE number 4049669 (Why is no real title available?)
- scientific article; zbMATH DE number 5130813 (Why is no real title available?)
- Monochromatic triangles in two-colored plane
- Triangles in a complete chromatic graph with three colors
- 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
- Frustrated triangles
- Anti-Ramsey Multiplicities
- 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
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)
