AAAAAA

   
Results: 1-16 |
Results: 16
On the chromatic number of set systems
Authors: Kostochka, A Mubayi, D Rodl, V Tetali, P
Citation: A. Kostochka et al., On the chromatic number of set systems, RAND STR AL, 19(2), 2001, pp. 87-98
On graphs with small Ramsey numbers
Authors: Kostochka, AV Rodl, V
Citation: Av. Kostochka et V. Rodl, On graphs with small Ramsey numbers, J GRAPH TH, 37(4), 2001, pp. 198-204
On bipartite graphs with linear Ramsey numbers
Authors: Graham, RL Rodl, V Rucinski, A
Citation: Rl. Graham et al., On bipartite graphs with linear Ramsey numbers, COMBINATORI, 21(2), 2001, pp. 199-209
Integer and fractional packings in dense graphs
Authors: Haxell, PE Rodl, V
Citation: Pe. Haxell et V. Rodl, Integer and fractional packings in dense graphs, COMBINATORI, 21(1), 2001, pp. 13-38
Matchings meeting quotas and their impact in the blow-up lemma
Authors: Rodl, V Rucinski, A Wagner, M
Citation: V. Rodl et al., Matchings meeting quotas and their impact in the blow-up lemma, SIAM J COMP, 31(2), 2001, pp. 428-446
Independent arithmetic progressions in clique-free graphs on the natural numbers
Authors: Gunderson, DS Leader, I Promel, HJ Rodl, V
Citation: Ds. Gunderson et al., Independent arithmetic progressions in clique-free graphs on the natural numbers, J COMB TH A, 93(1), 2001, pp. 1-17
On graphs with linear Ramsey numbers
Authors: Graham, RL Rodl, V Rucinski, A
Citation: Rl. Graham et al., On graphs with linear Ramsey numbers, J GRAPH TH, 35(3), 2000, pp. 176-192
On size Ramsey numbers of graphs with bounded degree
Authors: Rodl, V Szemeredi, E
Citation: V. Rodl et E. Szemeredi, On size Ramsey numbers of graphs with bounded degree, COMBINATORI, 20(2), 2000, pp. 257-262
An algorithmic regularity lemma for hypergraphs
Authors: Czygrinow, A Rodl, V
Citation: A. Czygrinow et V. Rodl, An algorithmic regularity lemma for hypergraphs, SIAM J COMP, 30(4), 2000, pp. 1041-1066
Constructive quasi-Ramsey numbers and tournament ranking
Authors: Czygrinow, A Poljak, S Rodl, V
Citation: A. Czygrinow et al., Constructive quasi-Ramsey numbers and tournament ranking, SIAM J DISC, 12(1), 1999, pp. 48-63
Perfect matchings in epsilon-regular graphs and the blow-up lemma
Authors: Rodl, V Rucinski, A
Citation: V. Rodl et A. Rucinski, Perfect matchings in epsilon-regular graphs and the blow-up lemma, COMBINATORI, 19(3), 1999, pp. 437-452
Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
Authors: Gunderson, DS Rodl, V Sidorenko, A
Citation: Ds. Gunderson et al., Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, J COMB TH A, 88(2), 1999, pp. 342-367
Non-ramsey graphs are c log n-universal
Authors: Promel, HJ Rodl, V
Citation: Hj. Promel et V. Rodl, Non-ramsey graphs are c log n-universal, J COMB TH A, 88(2), 1999, pp. 379-384
Induced Ramsey numbers
Authors: Kohayakawa, Y Promel, HJ Rodl, V
Citation: Y. Kohayakawa et al., Induced Ramsey numbers, COMBINATORI, 18(3), 1998, pp. 373-404
On large systems of sets with no large weak delta-subsystems
Authors: Kostochka, AV Rodl, V
Citation: Av. Kostochka et V. Rodl, On large systems of sets with no large weak delta-subsystems, COMBINATORI, 18(2), 1998, pp. 235-240
Biased positional games on hypergraphs
Authors: Duffus, D Luczak, T Rodl, V
Citation: D. Duffus et al., Biased positional games on hypergraphs, ST SCI M H, 34(1-3), 1998, pp. 141-149
Risultati: 1-16 |