Ramsey goodness of books revisited

F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc (2)

1930

Earlier work this paper cites.

P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compos. Math

1935

Earlier work this paper cites.

P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc

1947

Earlier work this paper cites.

P. Erdős, On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7

1962

Earlier work this paper cites.

P. Erdős, On extremal problems of graphs and generalized graphs, Israel J. Math

1964

Earlier work this paper cites.

P. Erdős, On some new inequalities concerning extremal properties of graphs, in Theory of Graphs (Proc. Colloq., Tihany, 1966) , Academic Press, New York, 1968, pp. 77–81

1968

Earlier work this paper cites.

M. Simonovits, A method for solving extremal problems in graph theory, stability problems, in Theory of Graphs (Proc. Colloq., Tihany, 1966) , Academic Press, New York, 1968, pp. 279–319

1968

Earlier work this paper cites.

B. Andrásfai, P. Erdős, and V. T. Sós, On the connection between chromatic number, maximal clique minimal degree of a graph, Discrete Math

1974

Earlier work this paper cites.

S. A. Burr, P. Erdős, and J. H. Spencer, Ramsey theorems for multiple copies of graphs, Trans. Amer. Math. Soc

1975

Earlier work this paper cites.

V. Chvátal, Tree-complete graph Ramsey numbers, J. Graph Theory

1977

Earlier work this paper cites.

P. Erdős, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The size Ramsey number, Period. Math. Hungar

1978

Earlier work this paper cites.

S. A. Burr, Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc

1981

Cited alongside, same era.

N. Wormald, The asymptotic distribution of short cycles in random regular graphs, J. Combin. Theory Ser. B

Original

1981

Cited alongside, same era.

S. A. Burr and P. Erdős, Generalizations of a Ramsey-theoretic result of Chvátal, J. Graph Theory

1983

Cited alongside, same era.

P. Erdős and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3

1983

Cited alongside, same era.

N. Alon, Testing subgraphs in large graphs, Random Structures Algorithms

2002

Cited alongside, same era.

V. Nikiforov and C. C. Rousseau, Large generalized books are p p -good, J. Combin. Theory Ser. B

Z. Füredi, A proof of the stability of extremal graphs, Simonovits’ stability from Szemerédi’s regularity, J. Combin. Theory Ser. B 115

2015

Later among the works it cites.

D. Conlon, J. Fox, C. Lee, and B. Sudakov, Ramsey numbers of cubes versus cliques, Combinatorica

2016

Later among the works it cites.

D. Conlon, The Ramsey number of books, Adv. Comb

2019

Later among the works it cites.

M. Chudnovsky, J. Fox, A. Scott, P. Seymour, and S. Spirkl, Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs, J. Graph Theory

2020

Later among the works it cites.

D. Conlon, J. Fox, and B. Sudakov, Short proofs of some extremal results III, Random Structures Algorithms 57

2020

Later among the works it cites.