Geodesic
A bipartite Ramsey problem and the Zarankiewicz numbers
Glasgow mathematical journal, Tome 19 (1978) no. 1, pp. 13-26

Voir la notice de l'article provenant de la source Cambridge University Press

Beineke and Schwenk [1] have defined the bipartite Ramsey number R(m,n), for integers m, n (1≤m≤n ), to be the smallest integer p such that any 2-colouring of the edges of the complete bipartite graph Kp, v forces the appearance of a monochromatic Km, n. In [1] the following results are established:with equality if there is a Hadamard matrix of order 2(n−1), n odd,if there is a Hadamard matrix of order 4(n−1), 
Irving, Robert W. A bipartite Ramsey problem and the Zarankiewicz numbers. Glasgow mathematical journal, Tome 19 (1978) no. 1, pp. 13-26. doi: 10.1017/S0017089500003323
@article{10_1017_S0017089500003323,
     author = {Irving, Robert W.},
     title = {A bipartite {Ramsey} problem and the {Zarankiewicz} numbers},
     journal = {Glasgow mathematical journal},
     pages = {13--26},
     year = {1978},
     volume = {19},
     number = {1},
     doi = {10.1017/S0017089500003323},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003323/}
}
TY  - JOUR
AU  - Irving, Robert W.
TI  - A bipartite Ramsey problem and the Zarankiewicz numbers
JO  - Glasgow mathematical journal
PY  - 1978
SP  - 13
EP  - 26
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003323/
DO  - 10.1017/S0017089500003323
ID  - 10_1017_S0017089500003323
ER  - 
%0 Journal Article
%A Irving, Robert W.
%T A bipartite Ramsey problem and the Zarankiewicz numbers
%J Glasgow mathematical journal
%D 1978
%P 13-26
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500003323/
%R 10.1017/S0017089500003323
%F 10_1017_S0017089500003323

[1] 1.Beineke, L. W. and Schwenk, A. J., On a bipartite form of the Ramsey problem, in Proc. Fifth British Combinatorial Conference, Aberdeen, 1975 (Utilitas Mathematica Publishing Inc., Winnipeg), 17–22. Google Scholar

[2] 2.Doyen, J., A table of small nondegenerate f-designs without repeated blocks, Typescript. Google Scholar

[3] 3.Guy, R. K., A many-facetted problem of Zarankiewicz, in The Many Facets of Graph Theory, Lecture Notes in Mathematics No. 110 (Springer-Verlag, 1969), 129–148. Google Scholar | DOI

[4] 4.Hales, A. W. and Jewett, R. I., Regularity and positional games, Trans. Amer. Math. Soc. 106 (1963), 222–229. Google Scholar | DOI

[5] 5.Harary, F., The foremost open problems in generalised Ramsey theory, in Proc. Fifth British Combinatorial Conference, Aberdeen, 1975 (Utilitas Mathematica Publishing Inc., Winnipeg), 269–282. Google Scholar

[6] 6.Zarankiewicz, K., Problem P101, Colloq. Math., 2 (1951) 301. Google Scholar

Cité par Sources :