Fetching the paper…
Reading the bibliography…
We show that, for $n$ large, there must exist at least \[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic $K_t$s in any two-colouring of the edges of $K_n$, where $C \approx 2.18$ is an explicitly defined constant.
P. Erdős, G. Szekeres: A combinatorial problem in geometry, Compositio Math
1935
Earlier work this paper cites.
A. W. Goodman: On sets of acquaintances and strangers at any party, Amer. Math. Monthly,
1959
Earlier work this paper cites.
P. Erdős: On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hung. Acad. Sci., VII, Ser. A
1962
Earlier work this paper cites.
G. Giraud: Sur la problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, J. Combin. Theory B,
1979
Cited alongside, same era.
L. A. Szekely: On the number of homogeneous subgraphs of a graph, Combinatorica,
1984
Cited alongside, same era.
A. Thomason: A disproof of a conjecture of Erdős in Ramsey theory, J. London Math. Soc.,
1989
Cited alongside, same era.
F. Franek, V. Rödl: 2-colourings of complete graphs with small number of monochromatic K 4 K_{4} subgraphs, Discrete Mathematics,
1993
Later among the works it cites.
C. Jagger, P. Šťovíček, A. Thomason: Multiplicites of subgraphs, Combinatorica,
1996
Later among the works it cites.
F. Franek, V. Rödl: On Erdős’s conjecture on multiplicites of complete subgraphs, Combinatorica,
2002
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…