Fetching the paper…
Reading the bibliography…
We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erd\H{o}s.
On an external problem in graph theory
Turán, P. (1941) · 1941
Earlier work this paper cites.
Equation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953) · 1953
Earlier work this paper cites.
On sets of acquaintances and strangers at any party
Goodman, A. W. (1959) · 1959
Earlier work this paper cites.
On the number of complete subgraphs contained in certain graphs
Erdős, P. (1962) · 1962
Earlier work this paper cites.
Blue-empty chromatic graphs
Lorden, G. (1962) · 1962
Earlier work this paper cites.
The number of simplicies in a complex
Kruskal, J. (1963) · 1963
Earlier work this paper cites.
A theorem of finite sets
Katona, G. (1968) · 1968
Earlier work this paper cites.
Sur le probleme de Goodman pour les quadrangles et la majoration des nombres de Ramsey
Giraud, G. (1979) · 1979
Earlier work this paper cites.
On the Ramsey multiplicities of graphs—problems and recent results
Burr, S. A. and Rosta, V. (1980) · 1980
Earlier work this paper cites.
On the number of complete subgraphs contained in certain graphs
Evans, J., Pulham, J. R., and Sheehan, J. (1981) · 1981
Earlier work this paper cites.
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt Jr, C. D., and Vecchi, M. P. (1983) · 1983
Earlier work this paper cites.
On the number of complete subgraphs of a graph II
Lovász, L. and Simonovits, M. (1983) · 1983
Earlier work this paper cites.
“Neural” computation of decisions in optimization problems
Hopfield, J. J. and Tank, D. W. (1985) · 1985
Earlier work this paper cites.
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · 1986
Earlier work this paper cites.
Simulated annealing without rejected moves
Greene, J. W. and Supowit, K. J. (1986) · 1986
Earlier work this paper cites.
Pseudo-random graphs
Thomason, A. (1987) · 1987
Earlier work this paper cites.
Tabu search — Part I
Glover, F. (1989) · 1989
Earlier work this paper cites.
A disproof of a conjecture of Erdős in Ramsey theory
Thomason, A. (1989) · 1989
Earlier work this paper cites.
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Dueck, G. and Scheuer, T. (1990) · 1990
Earlier work this paper cites.
Tabu search — Part II
Glover, F. (1990) · 1990
Earlier work this paper cites.
Quasi-random set systems
Chung, F. R. and Graham, R. L. (1991) · 1991
Earlier work this paper cites.
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
Franek, F. and Rödl, V. (1992) · 1992
Earlier work this paper cites.
2-colorings of complete graphs with a small number of monochromatic K 4 {K}_{4} subgraphs
Franek, F. and Rödl, V. (1993) · 1993
Earlier work this paper cites.
A correlation inequality for bipartite graphs
Sidorenko, A. (1993) · 1993
Earlier work this paper cites.
On Schur properties of random subsets of integers
Graham, R., Rödl, V., and Ruciński, A. (1996) · 1996
Earlier work this paper cites.
Multiplicities of subgraphs
Jagger, C., Št́ovíček, P., and Thomason, A. (1996) · 1996
Earlier work this paper cites.
Subgraph counting identities and Ramsey numbers
McKay, B. D. and Radziszowski, S. P. (1997) · 1997
Earlier work this paper cites.
Graph products and monochromatic multiplicities
Thomason, A. (1997) · 1997
Earlier work this paper cites.
Some new Ramsey colorings
Exoo, G. (1998) · 1998
Earlier work this paper cites.
A 2-coloring of [ 1 , n ] [1,n] can have ( n 2 ) / 22 + o ( n ) (n^{2})/22+o(n) monochromatic Schur triples, but not less!
Robertson, A. and Zeilberger, D. (1998) · 1998
Earlier work this paper cites.
CSDP, AC library for semidefinite programming
Borchers, B. (1999) · 1999
Earlier work this paper cites.
The cross-entropy method for combinatorial and continuous optimization
Rubinstein, R. (1999) · 1999
Cited alongside, same era.
The number of monochromatic Schur triples
Schoen, T. (1999) · 1999
Cited alongside, same era.
Neural networks for combinatorial optimization: a review of more than a decade of research
Smith, K. A. (1999) · 1999
Cited alongside, same era.
Efficient testing of large graphs
Alon, N., Fischer, E., Krivelevich, M., and Szegedy, M. (2000) · 2000
Cited alongside, same era.
On the minimum number of k k -cliques in graphs with restricted independence number
Nikiforov, V. (2001) · 2001
Cited alongside, same era.
On Erdős’s conjecture on multiplicities of complete subgraphs lower upper bound for cliques of size 6
Franek, F. (2002) · 2002
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., and Bengio, S. (2016) · 2016
Later among the works it cites.
On the densities of cliques and independent sets in graphs
Huang, H., Linial, N., Naves, H., Peled, Y., and Sudakov, B. (2016) · 2016
Later among the works it cites.
The clique density theorem
Reiher, C. (2016) · 2016
Later among the works it cites.
Silva, M. K. and Sato, C. M. (2016) · 2016
Later among the works it cites.
Rainbow triangles in three-colored graphs
Balogh, J., Hu, P., Lidickỳ, B., Pfender, F., Volec, J., and Young, M. (2017) · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the number of monochromatic Schur triples
Datskovsky, B. A. (2003) · 2003
Cited alongside, same era.
Extremal graph theory
Bollobás, B. (2004) · 2004
Cited alongside, same era.
The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning
Rubinstein, R. Y. and Kroese, D. P. (2004) · 2004
Cited alongside, same era.
Codes and Xor graph products
Alon, N. and Lubetzky, E. (2007) · 2007
Cited alongside, same era.
On monochromatic solutions of equations in groups
Cameron, P. J., Cilleruelo, J., and Serra, O. (2007) · 2007
Cited alongside, same era.
Flag algebras
Razborov, A. A. (2007) · 2007
Cited alongside, same era.
Lidickỳ, B. and Pfender, F. (2017) · 2017
Later among the works it cites.
The exact minimum number of triangles in graphs of given order and size, 2017
Liu, H., Pikhurko, O., and Staden, K. (2017) · 2017
Later among the works it cites.
Asymptotic structure of graphs with the minimum number of triangles
Pikhurko, O. and Razborov, A. (2017) · 2017
Later among the works it cites.
Ramsey multiplicity of linear patterns in certain finite abelian groups
Saad, A. and Wolf, J. (2017) · 2017
Later among the works it cites.
Strong forms of stability from flag algebra calculations
Pikhurko, O., Sliačan, J., and Tyros, K. (2019) · 2019
Later among the works it cites.
Experiment tracking with Weights and Biases
Biewald, L. (2020) · 2020
Later among the works it cites.
A census of small transitive groups and vertex-transitive graphs
Holt, D. and Royle, G. (2020) · 2020
Later among the works it cites.
Refuting conjectures in extremal combinatorics via linear programming
Wagner, A. Z. (2020) · 2020
Later among the works it cites.
Common and Sidorenko linear equations
Fox, J., Pham, H. T., and Zhao, Y. (2021) · 2021
Later among the works it cites.
GAP – Groups, Algorithms, and Programming, Version 4.11.1
GAP (2021) · 2021
Later among the works it cites.
On uncommon systems of equations
Kamcev, N., Liebenau, A., and Morrison, N. (2021) · 2021
Later among the works it cites.
Towards a characterisation of Sidorenko systems
Kamčev, N., Liebenau, A., and Morrison, N. (2021) · 2021
Later among the works it cites.
The feasible region of hypergraphs
Liu, X. and Mubayi, D. (2021) · 2021
Later among the works it cites.
The feasible region of induced graphs
Liu, X., Mubayi, D., and Reiher, C. (2021) · 2021
Later among the works it cites.
Sawin, W. (2021) · 2021
Later among the works it cites.
Common and Sidorenko equations in abelian groups
Versteegen, L. (2021) · 2021
Later among the works it cites.
Constructions in combinatorics via neural networks
Wagner, A. Z. (2021) · 2021
Later among the works it cites.
Behague, N., Morrison, N., and Noel, J. A. (2022) · 2022
Closest in time.
The transitive groups of degree 48 48 and some applications
Holt, D., Royle, G., and Tracey, G. (2022) · 2022
Closest in time.
Improved lower bounds for multicolour Ramsey numbers using SAT-solvers
Rowley, F. (2022) · 2022
Closest in time.
Off-diagonal commonality of graphs via entropy
Behague, N., Morrison, N., and Noel, J. A. (2023) · 2023
Closest in time.
An exponential improvement for diagonal Ramsey
Campos, M., Griffiths, S., Morris, R., and Sahasrabudhe, J. (2023) · 2023
Closest in time.
Ramsey multiplicity and the Turán coloring
Fox, J. and Wigderson, Y. (2023) · 2023
Closest in time.
The Rado multiplicity problem in vector spaces over finite fields
Rué, J. and Spiegel, C. (2023) · 2023
Closest in time.
Linear configurations containing 4-term arithmetic progressions are uncommon
Versteegen, L. (2023) · 2023
Closest in time.
Personal communication
McKay, B. (2024) · 2024
Closest in time.