Edge-coloring cliques with three colors on all 4-cliques (Q1280308): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:48, 14 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Edge-coloring cliques with three colors on all 4-cliques |
scientific article |
Statements
Edge-coloring cliques with three colors on all 4-cliques (English)
0 references
14 March 1999
0 references
For integers \(n,p\) and \(q\), a \((p,q)\)-coloring of \(K_n\) is a coloring of the edges of \(K_n\) in which the edges of every \(p\)-cligue together receive at least \(q\) colors. Let \(f(n,p,q)\) denote the minimum number of colors in a \((p,q)\)-coloring of \(K_n\). The author proves that \(f(n,4,3)<\exp(\sqrt{c\log n}(1+O(1)))\), where \(c=4\log 2\). This improves the corresponding result by \textit{P. Erdős} and \textit{A. Gyárfás} [A variant of the classical Ramsey problem, Combinatorica 17, No. 4, 459-467 (1997; Zbl 0910.05034)].
0 references
generalized Ramsey
0 references
Ramsey theory
0 references
coloring
0 references
bounds
0 references