Ramsey numbers for sparse graphs

REGULAR PARTITIONS OF GRAPHS

Endre Szemerédi · Defense Technical Information Center (DTIC) · 1975 · 806 citations

Natural Sciences, Computer Science, Mathematics +10

On a combinatorial problem in geometry

H. L. Abbott, D. Hanson · Discrete Mathematics · 1975 · 462 citations

Natural Sciences, Mathematics, Combinatorics +8

The Ramsey number of a graph with bounded maximum degree

C Chvatál, V. Rödl, Endre Szemerédi et al. · Journal of Combinatorial Theory Series B · 1983 · 185 citations

Natural Sciences, Mathematics, Combinatorics +10

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

Richard A. Duke, Hanno Lefmann, V. Rödl · SIAM Journal on Computing · 1995 · 112 citations

Computing, Computer Science, Algorithms +10

Graphs with Linearly Bounded Ramsey Numbers

G.T. Chen, R. H. Schelp · Journal of Combinatorial Theory Series B · 1993 · 104 citations

Natural Sciences, Mathematics, Combinatorics +8