Disjunctive Rado numbers for .
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
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.
Xu, Xiaodong, Xie, Zheng, Exoo, Geoffrey, Radziszowski, Stanisław P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Fon-Der-Flaass, Dmitri (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dennis Geller, Hudson Kronk (1974)
Fundamenta Mathematicae
Similarity:
Jungić, Veselin, Radoičić, Radoš (2003)
Integers
Similarity:
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity:
Isaak, Garth (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
Exoo, Geoffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: