-
1
-
-
0011658319
-
Graphs with linearly bounded Ramsey numbers
-
Chen G., and Schelp R. Graphs with linearly bounded Ramsey numbers. J. Combinatorial Theory B 57 (1993) 138-149
-
(1993)
J. Combinatorial Theory B
, vol.57
, pp. 138-149
-
-
Chen, G.1
Schelp, R.2
-
2
-
-
0000510437
-
On the magnitude of generalized Ramsey numbers for graphs
-
Infinite and Finite Sets
-
Burr S.A., and Erdo{combining double acute accent}s P. On the magnitude of generalized Ramsey numbers for graphs. Infinite and Finite Sets. Colloquia Mathematica Societatis János Bolyai 10 1 (1975) 214-240
-
(1975)
Colloquia Mathematica Societatis János Bolyai
, vol.10
, Issue.1
, pp. 214-240
-
-
Burr, S.A.1
Erdos, P.2
-
4
-
-
34547663110
-
-
Cooley, O., N. Fountoulakis, D. Kühn and D. Osthus, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, submitted
-
-
-
-
5
-
-
34547702110
-
-
Cooley, O., N. Fountoulakis, D. Kühn and D. Osthus, Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, submitted
-
-
-
-
6
-
-
84960588672
-
Combinatorial theorems on classifications of subsets of a given set
-
Erdo{combining double acute accent}s P., and Rado R. Combinatorial theorems on classifications of subsets of a given set. Proc. London Mathematical Society 3 (1952) 417-439
-
(1952)
Proc. London Mathematical Society
, vol.3
, pp. 417-439
-
-
Erdos, P.1
Rado, R.2
-
8
-
-
30444454509
-
The Ramsey number for hypergraph cycles I
-
Haxell P.E., Łuczak T., Peng Y., Rödl V., Ruciński A., Simonovits M., and Skokan J. The Ramsey number for hypergraph cycles I. J. Combinatorial Theory A 113 (2006) 67-83
-
(2006)
J. Combinatorial Theory A
, vol.113
, pp. 67-83
-
-
Haxell, P.E.1
Łuczak, T.2
Peng, Y.3
Rödl, V.4
Ruciński, A.5
Simonovits, M.6
Skokan, J.7
-
9
-
-
34547650678
-
-
Haxell, P.E., T. Łuczak, Y. Peng, V. Rödl, A. Ruciński and J. Skokan, The Ramsey number for hypergraph cycles II, preprint
-
-
-
-
10
-
-
34547689114
-
-
Ishigami, Y., Linear Ramsey numbers for bounded-degree hypergraphs, preprint 2006
-
-
-
-
11
-
-
33746630986
-
On Ramsey numbers of uniform hypergraphs with given maximum degree
-
Kostochka A., and Rödl V. On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Combinatorial Theory A 113 (2006) 1555-1564
-
(2006)
J. Combinatorial Theory A
, vol.113
, pp. 1555-1564
-
-
Kostochka, A.1
Rödl, V.2
-
12
-
-
34547659312
-
-
Nagle, B., S. Olsen, V. Rödl and M. Schacht, On the Ramsey number of sparse 3-graphs, preprint
-
-
-
-
13
-
-
34547670432
-
-
Rödl, V., and M. Schacht, Regular partitions of hypergraphs, Combinatorics, Probability & Computing, to appear
-
-
-
|