Searching for "A 2-Coloring of [1" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
A 2-coloring of [1,N] can have (1/22)N 2 + O(N) monochromatic Schur triples, but not less
- …arXiv:math/9803149v2 [math.CO] 12 Aug 1998 A 2-COLORING OF [1,N] CAN HAVE (1/22)N 2 + O…
- Cited by 1 (0 self) – Add To MetaCart
-
A 2-COLORING OF [1, n] CAN HAVE n2 2a(a2 + O(n) +2a+3) MONOCHROMATIC TRIPLES OF THE FORM
- …A 2-COLORING OF [1, n] CAN HAVE n2 2a(a2 + O(n) +2a+3) MONOCHROMATIC TRIPLES OF THE FORM {x, y, x…
- Add To MetaCart
-
A 2-Coloring Of [1,N] Can Have (1/22)N² +O(N) MONOCHROMATIC SCHUR TRIPLES, BUT NOT LESS!
- …A 2-COLORING OF [1,N] CAN HAVE (1/22)N 2 + O(N) MONOCHROMATIC SCHUR TRIPLES, BUT NOT LESS! Aaron…
- Add To MetaCart
-
A 2-Coloring Of
- …A 2-COLORING OF [1; N ] CAN HAVE (1=22)N 2 +O(N) MONOCHROMATIC SCHUR TRIPLES, BUT NOT LESS…
- Add To MetaCart
-
Avoiding monochromatic sequences with special gaps, preprint
- … it exists) such that within every r-coloring of {1,2,...,n} there must be a monochromatic sequence {x1,x2…
- Cited by 2 (1 self) – Add To MetaCart
-
Revisiting Tucker’s algorithm to color circular arc graphs
- … cmax = 1. Assign color cmax to arc A1. 2. For i = 1, 2,... ,|F |−1, we move clockwise round and round…
- Cited by 5 (0 self) – Add To MetaCart
-
The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- … that this is about best, set 2r−2 n = (2r−2)k and consider the 2-coloring of a complete graph with (2r−1)k−2 = (2r−1…
- Add To MetaCart
Showing 1 through 7.
