Monochromatic and zero-sum sets of nondecreasing modified diameter.
Grynkiewicz, David, Sabar, Rasheed (2006)
The Electronic Journal of Combinatorics [electronic only]
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.
Grynkiewicz, David, Sabar, Rasheed (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhan, Tong (2009)
Integers
Similarity:
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity:
Fox, Jacob, Radoičić, Radoš (2005)
Integers
Similarity:
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
Saha, Laxman, Panigrahi, Pratima, Kumar, Pawan (2011)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Robertson, Aaron, Zeilberger, Doron (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Robertson, Aaron (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Manske, Jacob (2008)
Integers
Similarity:
András Hajnal (2008)
Fundamenta Mathematicae
Similarity:
Given a function f, a subset of its domain is a rainbow subset for f if f is one-to-one on it. We start with an old Erdős problem: Assume f is a coloring of the pairs of ω₁ with three colors such that every subset A of ω₁ of size ω₁ contains a pair of each color. Does there exist a rainbow triangle? We investigate rainbow problems and results of this style for colorings of pairs establishing negative "square bracket" relations.