Non-monochromatic triangles in a 2-edge-coloured graph (Q2001990): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recent developments in graph Ramsey theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Erdős-Hajnal conjecture for rainbow triangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unavoidable patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramsey-type results for Gallai colorings / rank | |||
Normal rank |
Latest revision as of 21:25, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-monochromatic triangles in a 2-edge-coloured graph |
scientific article |
Statements
Non-monochromatic triangles in a 2-edge-coloured graph (English)
0 references
11 July 2019
0 references
Summary: Let \(G = (V,E)\) be a simple graph and let \(\{R,B\}\) be a partition of \(E\). We prove that whenever \(|E| + \text{min}\{ |R|, |B| \} > \binom{|V|}{2}\), there exists a subgraph of \(G\) isomorphic to \(K_3\) which contains edges from both \(R\) and \(B\). If instead equality holds, and $G$ has no such subgraph, then we show that \(G\) is in one of a few simple classes.
0 references
rainbow generalizations
0 references
Ramsey theory
0 references