On multiplicity of triangles (Q308327): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948 |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s13226-015-0136-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W924644238 / rank | |||
Normal rank |
Latest revision as of 01:53, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On multiplicity of triangles |
scientific article |
Statements
On multiplicity of triangles (English)
0 references
6 September 2016
0 references
\(M\left(K_3,G\right)\) denotes the minimum number of monochromatic copies of \(K_3\) that must occur in any 2-coloring of the edges of a graph \(G\). If \(k\), \(n\) are positive integers, with \(k\leq\frac n2\), and \(G\) is obtained from \(K_n\) by deleting any \(k\) parallel edges, \(M\left(K_3,G\right)\) has been determined in [\textit{V. Vijayalakshmi}, Ars Comb. 57, 257--284 (2000; Zbl 1064.05065)]. Bounds for another variation of the problem have been determined by the same author in [\textit{V. Vijayalakshmi}, ibid. 85, 341--352 (2007; Zbl 1224.05189)]. In the present paper, the authors consider the case where \(G\) is obtained from the complete graph \(K_{n+\ell}\) by removing the edges of a complete subgraph on \(\ell\) vertices. They apply a technique introduced in [\textit{L. Sauvé}, Am. Math. Mon. 68, 107--111 (1961; Zbl 0101.16702)] to simplify the determination of \(M\left(K_3,K_n\right)\) in [\textit{A. W. Goodman}, Am. Math. Mon. 66, 778--783 (1959; Zbl 0092.01305)].
0 references
complete graphs
0 references
edge coloring
0 references
multiplicity
0 references
triangles
0 references