Rainbow Ramsey theory.
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Axenovich, Maria, Fon-Der-Flaass, Dmitri (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
Brown, Tom C. (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.
Sabo, Dusty, Schaal, Daniel, Tokaz, Jacent (2007)
Integers
Similarity:
Axenovich, Maria, Manske, Jacob (2008)
Integers
Similarity:
Zhan, Tong (2009)
Integers
Similarity:
Schaal, Daniel, Snevily, Hunter (2008)
Integers
Similarity:
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Richard H. Schelp (2002)
Discussiones Mathematicae Graph Theory
Similarity:
The focus of this article is on three of the author's open conjectures. The article itself surveys results relating to the conjectures and shows where the conjectures are known to hold.
Dennis Geller, Hudson Kronk (1974)
Fundamenta Mathematicae
Similarity:
Fox, Jacob, Radoičić, Radoš (2005)
Integers
Similarity:
Colton Magnant, Daniel M. Martin (2011)
Discussiones Mathematicae Graph Theory
Similarity:
If rooms in an office building are allowed to be any rectangular solid, how many colors does it take to paint any configuration of rooms so that no two rooms sharing a wall or ceiling/floor get the same color? In this work, we provide a new construction which shows this number can be arbitrarily large.