Article

On the Ramsey Problem for Multicolor Bipartite Graphs

Department of Philosophy and Center for Logic and Epistemology, State University of Campinas, Campinas, SP, Brazil; Department of Mathematics, State University of Maringá, Maringá, PR, Brazil
Advances in Applied Mathematics (Impact Factor: 0.84). 01/1999; DOI: 10.1006/aama.1998.0620

ABSTRACT Giveni, jpositive integers, letKi, jdenote a bipartite complete graph and letRr(m, n) be the smallest integerasuch that for anyr-coloring of the edges ofKa, aone can always find a monochromatic subgraph isomorphic toKm, n. In other words, ifa ≥ Rr(m, n) then every matrixa × awith entries in {0, 1,…,r − 1} always contains a submatrixm × norn × mwhose entries arei, 0 ≤ i ≤ r − 1. We shall prove thatR2(m, n) ≤ 2m(n − 1) + 2m − 1 − 1, which generalizes the previous resultsR2(2, n) ≤ 4n − 3 andR2(3, n) ≤ 8n − 5 due to Beineke and Schwenk. Moreover, we find a class of lower bounds based on properties of orthogonal Latin squares which establishes that limr → ∞ Rr(2, 2)r − 2 = 1.

0 Bookmarks
 · 
47 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Some bounds for G 1 --G 2 bipartite Ramsey numbers b(G 1 ; G 2 ) are given, which imply that b(K 2; 2 ; K 1;n )=n + q for the range q 2 - q +16n6q 2 , where q is a prime power. Our new construction establishes in particular that b(K 2;n ; K 2;n )=4n - 3if4n - 3 is a prime power, reinforcing a weaker form of a conjecture due to Beineke and Schwenk. Particular relationships between b(G 1 ; G 2 ) and G 1 --G 2 Ramsey numbers are also determined. c # 2000 Elsevier Science B.V. All rights reserved. MSC: 05C55 Keywords: Generalized Ramsey theory; Bipartite Ramsey number; Strongly regular graphs 1. Introduction Given G 1 and G 2 bipartite graphs, the bipartite Ramsey number b(G 1 ; G 2 )isthe least positive integer b such that if the edges of K b; b are colored with two colors, then there will always exist an isomorphic copy of G 1 in the #rst color, or a copy of G 2 in the second color. In other words, b(G 1 ; G 2 ) is the least positive integer b such that given any subgraph H...
    12/2000;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Some bounds for G1–G2 bipartite Ramsey numbers b(G1;G2) are given, which imply that b(K2,2;K1,n)=n+q for the range q2−q+1⩽n⩽q2, where q is a prime power. Our new construction establishes in particular that b(K2,n;K2,n)=4n−3 if 4n−3 is a prime power, reinforcing a weaker form of a conjecture due to Beineke and Schwenk. Particular relationships between b(G1;G2) and G1–G2 Ramsey numbers are also determined.
    Discrete Mathematics. 08/2000; 223(s 1–3):83–92.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we establish a connection between polarized partition relations and the functionAq (n, d) of coding theory, which implies some known results and new examples of polarized relations. A connection between Aq(n, d) and the Zarankiewicz numbers is also discussed.
    European Journal of Combinatorics 01/2001; 22:351-356. · 0.66 Impact Factor

Full-text (2 Sources)

Download
40 Downloads
Available from
May 29, 2014