New Lower Bounds on the Multicolor Ramsey Numbers rk(C4)
β Scribed by Felix Lazebnik; Andrew J. Woldar
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 85 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
The multicolor Ramsey number r k (C 4 ) is the smallest integer n for which any k-coloring of the edges of the complete graph K n must produce a monochromatic 4-cycle. It was proved earlier that r k (C 4 ) k 2 &k+2 for k&1 being a prime power. In this note we establish r k (C 4 ) k 2 +2 for k being an odd prime power. 2000
π SIMILAR VOLUMES
## Abstract Graph __G__ is a (__k__,β__p__)βgraph if __G__ does not contain a complete graph on __k__ vertices __K__~__k__~, nor an independent set of order __p__. Given a (__k__,β__p__)βgraph __G__ and a (__k__,β__q__)βgraph __H__, such that __G__ and __H__ contain an induced subgraph isomorphic t
A truncated transversal design TTD of type g k m 1 is a [k, k+1]-GDD of type g k m 1 in which each point on the group of size m lies only in blocks of size k+1. Thus a TTD of type g k m 1 is equivalent to a transversal design TD (k, g) having m disjoint parallel classes of blocks. We employ a new co