A multiplicity problem related to Schur numbers.
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity:
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity:
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhan, Tong (2009)
Integers
Similarity:
Ardal, Hayri, Dvořák, Zdeněk, Jungić, Veselin, Kaiser, Tomáš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Doerr, Benjamin, Gnewuch, Michael, Hebbinghaus, Nils (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fox, Jacob, Radoičić, Radoš (2005)
Integers
Similarity:
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
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.
Grytczuk, Jarosław (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Xie, Zheng, Exoo, Geoffrey, Radziszowski, Stanisław P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brown, Tom C. (2005)
Integers
Similarity:
Robertson, Aaron (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: