On rainbow arithmetic progressions.
Axenovich, Maria, Fon-Der-Flaass, Dmitri (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Monochromatic forests of finite subsets of .”
On rainbow arithmetic progressions.
A partition of the non-negative integers, with applications.
Brown, Tom C. (2005)
Integers
Similarity:
Some new exact van der Waerden numbers.
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
On monochromatic subsets of a rectangular grid.
Axenovich, Maria, Manske, Jacob (2008)
Integers
Similarity:
An anti-Ramsey condition on trees.
Picollelli, Michael E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parity vertex colorings of binomial trees
Petr Gregor, Riste Škrekovski (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We show for every k ≥ 1 that the binomial tree of order 3k has a vertex-coloring with 2k+1 colors such that every path contains some color odd number of times. This disproves a conjecture from [1] asserting that for every tree T the minimal number of colors in a such coloring of T is at least the vertex ranking number of T minus one.
Rainbow 3-term arithmetic progressions.
Jungić, Veselin, Radoičić, Radoš (2003)
Integers
Similarity:
The distinguishing chromatic number.
Collins, Karen L., Trenk, Ann N. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Thue-like sequences and rainbow arithmetic progressions.
Grytczuk, Jarosław (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow Ramsey theory.
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
Discrepancy of cartesian products of arithmetic progressions.
Doerr, Benjamin, Srivastav, Anand, Wehr, Petra (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Locally bounded -colorings of trees
C. Bentz, C. Picouleau (2009)
RAIRO - Operations Research
Similarity:
Given a tree with vertices, we show, by using a dynamic programming approach, that the problem of finding a 3-coloring of respecting local (, associated with prespecified subsets of vertices) color bounds can be solved in log) time. We also show that our algorithm can be adapted to the case of -colorings for fixed .
A van der Waerden variant.
Compton, Kevin J. (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: