Weakened Gallai-Ramsey numbers
In the Ramsey theory of graphs, one seeks to determine the value of the Ramsey number rt(n), defined to be the least natural number p such that every coloring of the edges of Kp using t colors results in a monochromatic copy of Kn in some color. In this paper, we demonstrate the standard techniques...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University Constantin Brancusi of Targu-Jiu
2018-08-01
|
| Series: | Surveys in Mathematics and its Applications |
| Subjects: | |
| Online Access: | http://www.utgjiu.ro/math/sma/v13/p13_08.pdf |