Geodesic
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets
Glasgow mathematical journal, Tome 22 (1981) no. 1, pp. 31-41

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

Following the notation in Faudree and Schelp [3], we write G → (F, H) to mean that every 2-coloring of E(G), the edge set of G, contains a green (the first color) F or a red (the second color) H. Then the Ramsey number r(F, H) of two graphs F and H with no isolated vertices has been defined as the minimum p such that Kp → (F, H). 
Harary, Frank; Harborth, Heiko; Mengersen, Ingrid. Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets. Glasgow mathematical journal, Tome 22 (1981) no. 1, pp. 31-41. doi: 10.1017/S0017089500004444
@article{10_1017_S0017089500004444,
     author = {Harary, Frank and Harborth, Heiko and Mengersen, Ingrid},
     title = {Generalized {Ramsey} theory for graphs {XII:} {Bipartite} {Ramsey} sets},
     journal = {Glasgow mathematical journal},
     pages = {31--41},
     year = {1981},
     volume = {22},
     number = {1},
     doi = {10.1017/S0017089500004444},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004444/}
}
TY  - JOUR
AU  - Harary, Frank
AU  - Harborth, Heiko
AU  - Mengersen, Ingrid
TI  - Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets
JO  - Glasgow mathematical journal
PY  - 1981
SP  - 31
EP  - 41
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004444/
DO  - 10.1017/S0017089500004444
ID  - 10_1017_S0017089500004444
ER  - 
%0 Journal Article
%A Harary, Frank
%A Harborth, Heiko
%A Mengersen, Ingrid
%T Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets
%J Glasgow mathematical journal
%D 1981
%P 31-41
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004444/
%R 10.1017/S0017089500004444
%F 10_1017_S0017089500004444

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

[2] 2.Bollobás, B., Extremal graph theory (Academic Press, London, 1978). Google Scholar

[3] 3.Faudree, R. J. and Schelp, R. H., Path—path Ramsey—type numbers for the complete bipartite graph, J. Combinatorial Theory Ser. B 19 (1975) 161–173. Google Scholar | DOI

[4] 4.Harary, F., Graph theory (Addisop-Wesley, Reading, Mass., 1969). Google Scholar | DOI

[5] 5.Harary, F., The foremost open problems in generalized Ramsey theory, Proc. Fifth British Combinatorial Conference (Utilitas, Winnipeg (1976) 269–282). Google Scholar

[6] 6.Harborth, H. and Nitzschke, H.-M., Solution of Irving's Ramsey problem, Glasgow Math. J. 21 (1980), 187–197. Google Scholar | DOI

[7] 7.Irving, R. W., A bipartite Ramsey problem and the Zarankiewicz numbers, Glasgow Math. J. 19 (1978), 13–26. Google Scholar | DOI

Cité par Sources :