Rainbow Ramsey theory.
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Generalized Schur numbers for .”
Rainbow Ramsey theory.
Bicoloring Steiner triple systems.
Colbourn, Charles J., Dinitz, Jeffrey H., Rosa, Alexander (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On rainbow solutions to an equation with a quadratic term.
Zhan, Tong (2009)
Integers
Similarity:
On the degree of regularity of generalized van der Waerden triples.
Fox, Jacob, Radoičić, Radoš (2005)
Integers
Similarity:
Two color off-diagonal Rado-type numbers.
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow 3-term arithmetic progressions.
Jungić, Veselin, Radoičić, Radoš (2003)
Integers
Similarity:
Some new exact van der Waerden numbers.
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
Disjunctive Rado numbers for .
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
On rainbow arithmetic progressions.
Axenovich, Maria, Fon-Der-Flaass, Dmitri (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An improvement to Mathon's cyclotomic Ramsey colorings.
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
Elliot Krop, Irina Krop (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás. We show that [...] , slightly improving the bound of Axenovich. We make small improvements on bounds of Erdös and Gyárfás by showing [...] and for all even n ≢ 1(mod 3), f(n, 4, 5) ≤ n− 1. For a complete bipartite graph G= Kn,n, we show an n-color construction to color...
A van der Waerden variant.
Compton, Kevin J. (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A multiplicity problem related to Schur numbers.
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity: