Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs

Results in Mathematics

Volumn 41, Issue 1-2, 2002, Pages 140-149

  Lortz, Roland ^a,b   Mengersen, Ingrid ^a,c  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b VOLKSWAGEN AG   (Germany)

^c NONE   (Germany)

Author keywords

05C55; complete bipartite graphs; Ramsey numbers

Indexed keywords

EID: 85016023703     PISSN: 14226383     EISSN: 14209012     Source Type: Journal    
DOI: 10.1007/BF03322761     Document Type: Article

References (9)

1. F. R. K. Chung and R. L. Graham, On multicolor Ramsey numbers for complete bipartite graphs, J. Combin. Theory Ser. B 18 (1975), 164–169.
2. 2,n in: Graph theory, combinatorics, algorithms, and applications (eds. Y. Alavi et al.), SIAM, Philadelphia 1991, 207–211.
3. F. Harary, Recent results on generalized Ramsey theory for graphs, in: Graph theory and applications, Lecture Notes in Math. 303 (1972), 125–138.
4. 3,3 in: Graph theory, combinatorics, and applications (eds. Y. Alavi et al.), Volume 2, Wiley, New York 1991, 639–644.
5. M. Harborth and I. Mengersen, Some Ramsey numbers for complete bipartite graphs, Australas. J. Combin. 13 (1996), 119–128.
6. R. Lortz, Über Ramseyzahlen vollständiger bipartiter Graphen, Dissertation, Technische Universitat Braunschweig 1999.
7. 2,n), Util. Math., to appear.
8. 2,n), submitted.
9. W. D. Wallis, A. Penfold Street, and J. Seberry Wallis, Combinatorics: Room squares, sum-free sets, Hadamard matrices, Lecture Notes in Math.292 (1972).