-
1
-
-
84987589117
-
Subdivided graphs have linear Ramsey number
-
N. Alon, Subdivided graphs have linear Ramsey number, J. Graph Theory 18 (1994) 343-347.
-
(1994)
J. Graph Theory
, vol.18
, pp. 343-347
-
-
Alon, N.1
-
2
-
-
10044250663
-
Ramsey numbers involving graphs with long suspended paths
-
S. Burr, Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc. (2) 24 (1981) 405-413.
-
(1981)
J. London Math. Soc.
, vol.24
, Issue.2
, pp. 405-413
-
-
Burr, S.1
-
3
-
-
0000510437
-
On the magnitude of generalized Ramsey numbers
-
North-Holland, Amsterdam
-
S.A. Burr and P. Erdos, On the magnitude of generalized Ramsey numbers, in: Colloquia Mathematica Societatis János Bolyai 10, Infinite and Finite Sets, vol. 1 (North-Holland, Amsterdam, 1973) 215-240.
-
(1973)
Colloquia Mathematica Societatis János Bolyai 10, Infinite and Finite Sets
, vol.1
, pp. 215-240
-
-
Burr, S.A.1
Erdos, P.2
-
4
-
-
0003030478
-
Generalization of a Ramsey-theoretic result of Chvátal
-
S. Burr and P. Erdos, Generalization of a Ramsey-theoretic result of Chvátal, J. Graph Theory 7 (1983) 39-45.
-
(1983)
J. Graph Theory
, vol.7
, pp. 39-45
-
-
Burr, S.1
Erdos, P.2
-
5
-
-
0011658319
-
Graphs with linear bounded Ramsey numbers
-
G. Chen and R.H. Schelp, Graphs with linear bounded Ramsey numbers, J. Combin. Theory B 57 (1993) 138-149.
-
(1993)
J. Combin. Theory B
, vol.57
, pp. 138-149
-
-
Chen, G.1
Schelp, R.H.2
-
6
-
-
84986987090
-
Tree-complete graph Ramsey numbers
-
V. Chvátal, Tree-complete graph Ramsey numbers, J. Graph Theory 1 (1977) 93.
-
(1977)
J. Graph Theory
, vol.1
, pp. 93
-
-
Chvátal, V.1
-
7
-
-
0003044449
-
The Ramsey number of a graph with bounded maximum degree
-
V. Chvátal, V. Rödl, E. Szemerédi and T. Trotter, The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory B 34 (1983) 239-243.
-
(1983)
J. Combin. Theory B
, vol.34
, pp. 239-243
-
-
Chvátal, V.1
Rödl, V.2
Szemerédi, E.3
Trotter, T.4
-
8
-
-
0005386220
-
2,2
-
Y. Alavi et al., eds., Proceedings in Applied Mathematics 5.4, Chapter 19 SIAM, Philadelphia, PA
-
2,2, in: Graph Theory, Combinatorics, Algorithms, and Applications, in: Y. Alavi et al., eds., Proceedings in Applied Mathematics 5.4, Chapter 19 (SIAM, Philadelphia, PA, 1991) 207-211.
-
(1991)
Graph Theory, Combinatorics, Algorithms, and Applications
, pp. 207-211
-
-
Exoo, G.1
Harborth, H.2
Mengersen, I.3
-
12
-
-
0042106410
-
The Ramsey number of an N-edge graph versus a triangle is at most 2N + 1
-
A.F. Sidorenko, The Ramsey number of an N-edge graph versus a triangle is at most 2N + 1, J. Combin. Theory B 58 (1993) 185-196.
-
(1993)
J. Combin. Theory B
, vol.58
, pp. 185-196
-
-
Sidorenko, A.F.1
|