{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:46:50Z","timestamp":1777081610682,"version":"3.51.4"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007537","name":"Freie Universit\u00e4t Berlin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007537","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erd\u0151s. Most notably, we improve the upper bounds on the Ramsey multiplicity of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$K_4$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>K<\/mml:mi>\n                            <mml:mn>4<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$K_5$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>K<\/mml:mi>\n                            <mml:mn>5<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and settle the minimum number of independent sets of size 4 in graphs with clique number at most 4. Motivated by the elusiveness of the symmetric Ramsey multiplicity problem, we also introduce an off-diagonal variant and obtain tight results when counting monochromatic\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$K_4$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>K<\/mml:mi>\n                            <mml:mn>4<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    or\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$K_5$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>K<\/mml:mi>\n                            <mml:mn>5<\/mml:mn>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    in only one of the colors and triangles in the other. The extremal constructions for each problem turn out to be blow-ups of a graph of constant size and were found through search heuristics. They are complemented by lower bounds established using flag algebras, resulting in a fully computer-assisted approach. For some of our theorems we can also derive that the extremal construction is stable in a very strong sense. More broadly, these problems lead us to the study of the region of possible pairs of clique and independent set densities that can be realized as the limit of some sequence of graphs.\n                  <\/jats:p>","DOI":"10.1007\/s10208-024-09675-6","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T14:01:55Z","timestamp":1724680915000},"page":"1777-1814","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["New Ramsey Multiplicity Bounds and Search Heuristics"],"prefix":"10.1007","volume":"25","author":[{"given":"Olaf","family":"Parczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Spiegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"4","key":"9675_CR1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N Alon","year":"2000","unstructured":"N.\u00a0Alon, E.\u00a0Fischer, M.\u00a0Krivelevich, and M.\u00a0Szegedy. Efficient testing of large graphs. Combinatorica, 20(4):451\u2013476, 2000.","journal-title":"Combinatorica"},{"issue":"1","key":"9675_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s00493-007-0042-5","volume":"27","author":"N Alon","year":"2007","unstructured":"N.\u00a0Alon and E.\u00a0Lubetzky. Codes and Xor graph products. Combinatorica, 27(1):13\u201333, 2007.","journal-title":"Combinatorica"},{"key":"9675_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.jctb.2017.04.002","volume":"126","author":"J Balogh","year":"2017","unstructured":"J.\u00a0Balogh, P.\u00a0Hu, B.\u00a0Lidick\u1ef3, F.\u00a0Pfender, J.\u00a0Volec, and M.\u00a0Young. Rainbow triangles in three-colored graphs. Journal of Combinatorial Theory, Series B, 126:83\u2013113, 2017.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9675_CR4","unstructured":"N.\u00a0Behague, N.\u00a0Morrison, and J.\u00a0A. Noel. Common pairs of graphs. arXiv preprintarXiv:2208.02045, 2022."},{"key":"9675_CR5","unstructured":"N.\u00a0Behague, N.\u00a0Morrison, and J.\u00a0A. Noel. Off-diagonal commonality of graphs via entropy. arXiv preprintarXiv:2307.03788, 2023."},{"key":"9675_CR6","unstructured":"I.\u00a0Bello, H.\u00a0Pham, Q.\u00a0V. Le, M.\u00a0Norouzi, and S.\u00a0Bengio. Neural combinatorial optimization with reinforcement learning. arXiv preprintarXiv:1611.09940, 2016."},{"key":"9675_CR7","unstructured":"L.\u00a0Biewald. Experiment tracking with Weights and Biases, 2020. Software available from wandb.com."},{"key":"9675_CR8","unstructured":"B.\u00a0Bollob\u00e1s. Extremal graph theory. Courier Corporation, 2004."},{"issue":"1\u20134","key":"9675_CR9","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"B.\u00a0Borchers. CSDP, AC library for semidefinite programming. Optimization methods and Software, 11(1-4):613\u2013623, 1999.","journal-title":"Optimization methods and Software"},{"issue":"4","key":"9675_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/jgt.3190040403","volume":"4","author":"SA Burr","year":"1980","unstructured":"S.\u00a0A. Burr and V.\u00a0Rosta. On the Ramsey multiplicities of graphs-problems and recent results. Journal of Graph Theory, 4(4):347\u2013361, 1980.","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"9675_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.4171\/rmi\/499","volume":"23","author":"PJ Cameron","year":"2007","unstructured":"P.\u00a0J. Cameron, J.\u00a0Cilleruelo, and O.\u00a0Serra. On monochromatic solutions of equations in groups. Revista Matem\u00e1tica Iberoamericana, 23(1):385\u2013395, 2007.","journal-title":"Revista Matem\u00e1tica Iberoamericana"},{"key":"9675_CR12","unstructured":"M.\u00a0Campos, S.\u00a0Griffiths, R.\u00a0Morris, and J.\u00a0Sahasrabudhe. An exponential improvement for diagonal Ramsey. arXiv preprintarXiv:2303.09521, 2023."},{"issue":"1","key":"9675_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1090\/S0894-0347-1991-1077279-1","volume":"4","author":"FR Chung","year":"1991","unstructured":"F.\u00a0R. Chung and R.\u00a0L. Graham. Quasi-random set systems. Journal of the American Mathematical Society, 4(1):151\u2013196, 1991.","journal-title":"Journal of the American Mathematical Society"},{"issue":"2","key":"9675_CR14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00493-012-2465-x","volume":"32","author":"D Conlon","year":"2012","unstructured":"D.\u00a0Conlon. On the Ramsey multiplicity of complete graphs. Combinatorica, 32(2):171\u2013186, 2012.","journal-title":"Combinatorica"},{"issue":"3","key":"9675_CR15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.jctb.2013.02.003","volume":"103","author":"S Das","year":"2013","unstructured":"S.\u00a0Das, H.\u00a0Huang, J.\u00a0Ma, H.\u00a0Naves, and B.\u00a0Sudakov. A problem of Erd\u0151s on the minimum number of $$k$$-cliques. Journal of Combinatorial Theory, Series B, 103(3):344\u2013373, 2013.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"9675_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0196-8858(03)00010-1","volume":"31","author":"BA Datskovsky","year":"2003","unstructured":"B.\u00a0A. Datskovsky. On the number of monochromatic Schur triples. Advances in Applied Mathematics, 31(1):193\u2013198, 2003.","journal-title":"Advances in Applied Mathematics"},{"key":"9675_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.jda.2012.10.005","volume":"17","author":"A Deza","year":"2012","unstructured":"A.\u00a0Deza, F.\u00a0Franek, and M.\u00a0J. Liu. On a conjecture of Erd\u0151s for multiplicities of cliques. Journal of Discrete Algorithms, 17:9\u201314, 2012.","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"9675_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"G.\u00a0Dueck and T.\u00a0Scheuer. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90(1):161\u2013175, 1990.","journal-title":"Journal of Computational Physics"},{"issue":"3","key":"9675_CR19","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"P.\u00a0Erd\u0151s. On the number of complete subgraphs contained in certain graphs. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei, 7(3):459\u2013464, 1962.","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"issue":"3","key":"9675_CR20","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0095-8956(81)90054-X","volume":"30","author":"J Evans","year":"1981","unstructured":"J.\u00a0Evans, J.\u00a0R. Pulham, and J.\u00a0Sheehan. On the number of complete subgraphs contained in certain graphs. Journal of Combinatorial Theory, Series B, 30(3):364\u2013371, 1981.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"5","key":"9675_CR21","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1007\/s00373-014-1475-4","volume":"31","author":"C Even-Zohar","year":"2015","unstructured":"C.\u00a0Even-Zohar and N.\u00a0Linial. A note on the inducibility of $$4$$-vertex graphs. Graphs and Combinatorics, 31(5):1367\u20131380, 2015.","journal-title":"Graphs and Combinatorics"},{"key":"9675_CR22","doi-asserted-by":"crossref","first-page":"R29","DOI":"10.37236\/1367","volume":"5","author":"G Exoo","year":"1998","unstructured":"G.\u00a0Exoo. Some new Ramsey colorings. The Electronic Journal of Combinatorics, 5:R29, 1998.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"9675_CR23","doi-asserted-by":"crossref","unstructured":"G.\u00a0Exoo and M.\u00a0Tatarevic. New lower bounds for 28 classical Ramsey numbers. The Electronic Journal of Combinatorics, 22(3):P3.11, 2015.","DOI":"10.37236\/5254"},{"issue":"1","key":"9675_CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0963548312000508","volume":"22","author":"V Falgas-Ravry","year":"2013","unstructured":"V.\u00a0Falgas-Ravry and E.\u00a0R. Vaughan. Applications of the semi-definite method to the Tur\u00e1n density problem for 3-graphs. Combinatorics, Probability and Computing, 22(1):21\u201354, 2013.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"4","key":"9675_CR25","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1093\/qmath\/haaa068","volume":"72","author":"J Fox","year":"2021","unstructured":"J.\u00a0Fox, H.\u00a0T. Pham, and Y.\u00a0Zhao. Common and Sidorenko linear equations. The Quarterly Journal of Mathematics, 72(4):1223\u20131234, 2021.","journal-title":"The Quarterly Journal of Mathematics"},{"key":"9675_CR26","doi-asserted-by":"crossref","unstructured":"J.\u00a0Fox and Y.\u00a0Wigderson. Ramsey multiplicity and the Tur\u00e1n coloring. Advances in Combinatorics, 2023.","DOI":"10.19086\/aic.2023.2"},{"issue":"3","key":"9675_CR27","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s004930200024","volume":"22","author":"F Franek","year":"2002","unstructured":"F.\u00a0Franek. On Erd\u0151s\u2019s conjecture on multiplicities of complete subgraphs lower upper bound for cliques of size 6. Combinatorica, 22(3):451\u2013454, 2002.","journal-title":"Combinatorica"},{"key":"9675_CR28","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02351585","volume":"8","author":"F Franek","year":"1992","unstructured":"F.\u00a0Franek and V.\u00a0R\u00f6dl. Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. Graphs and Combinatorics, 8:299\u2013308, 1992.","journal-title":"Graphs and Combinatorics"},{"issue":"1\u20133","key":"9675_CR29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(93)90366-2","volume":"114","author":"F Franek","year":"1993","unstructured":"F.\u00a0Franek and V.\u00a0R\u00f6dl. 2-colorings of complete graphs with a small number of monochromatic $${K}_4$$ subgraphs. Discrete Mathematics, 114(1-3):199\u2013203, 1993.","journal-title":"Discrete Mathematics"},{"key":"9675_CR30","unstructured":"The GAP\u00a0Group. GAP \u2013 Groups, Algorithms, and Programming, Version 4.11.1, 2021."},{"key":"9675_CR31","doi-asserted-by":"crossref","unstructured":"M.\u00a0Gendreau and J.-Y. Potvin, editors. Handbook of Metaheuristics, volume\u00a02. Springer, New York, 2nd edition, 2010.","DOI":"10.1007\/978-1-4419-1665-5"},{"issue":"3","key":"9675_CR32","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0095-8956(79)90016-9","volume":"27","author":"G Giraud","year":"1979","unstructured":"G.\u00a0Giraud. Sur le probleme de Goodman pour les quadrangles et la majoration des nombres de Ramsey. Journal of Combinatorial Theory, Series B, 27(3):237\u2013253, 1979.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"5","key":"9675_CR33","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"F.\u00a0Glover. Future paths for integer programming and links to artificial intelligence. Computers & operations research, 13(5):533\u2013549, 1986.","journal-title":"Computers & operations research"},{"issue":"3","key":"9675_CR34","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"F.\u00a0Glover. Tabu search - Part I. ORSA Journal on computing, 1(3):190\u2013206, 1989.","journal-title":"ORSA Journal on computing"},{"issue":"1","key":"9675_CR35","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"F.\u00a0Glover. Tabu search - Part II. ORSA Journal on computing, 2(1):4\u201332, 1990.","journal-title":"ORSA Journal on computing"},{"issue":"9","key":"9675_CR36","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1080\/00029890.1959.11989408","volume":"66","author":"AW Goodman","year":"1959","unstructured":"A.\u00a0W. Goodman. On sets of acquaintances and strangers at any party. The American Mathematical Monthly, 66(9):778\u2013783, 1959.","journal-title":"The American Mathematical Monthly"},{"issue":"2","key":"9675_CR37","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1006\/jnth.1996.0155","volume":"61","author":"R Graham","year":"1996","unstructured":"R.\u00a0Graham, V.\u00a0R\u00f6dl, and A.\u00a0Ruci\u0144ski. On Schur properties of random subsets of integers. Journal of Number Theory, 61(2):388\u2013408, 1996.","journal-title":"Journal of Number Theory"},{"issue":"1","key":"9675_CR38","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/TCAD.1986.1270190","volume":"5","author":"JW Greene","year":"1986","unstructured":"J.\u00a0W. Greene and K.\u00a0J. Supowit. Simulated annealing without rejected moves. IEEE Transactions on Computer-Aided Design, 5(1):221\u2013228, 1986.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"9675_CR39","unstructured":"A.\u00a0Grzesik, J.\u00a0Lee, B.\u00a0Lidick\u1ef3, and J.\u00a0Volec. On tripartite common graphs. arXiv preprintarXiv:2012.02057, 2020."},{"key":"9675_CR40","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.jsc.2019.06.006","volume":"101","author":"D Holt","year":"2020","unstructured":"D.\u00a0Holt and G.\u00a0Royle. A census of small transitive groups and vertex-transitive graphs. Journal of Symbolic Computation, 101:51\u201360, 2020.","journal-title":"Journal of Symbolic Computation"},{"key":"9675_CR41","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.jalgebra.2021.06.018","volume":"607","author":"D Holt","year":"2022","unstructured":"D.\u00a0Holt, G.\u00a0Royle, and G.\u00a0Tracey. The transitive groups of degree $$48$$ and some applications. Journal of Algebra, 607:372\u2013386, 2022.","journal-title":"Journal of Algebra"},{"issue":"3","key":"9675_CR42","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"J.\u00a0J. Hopfield and D.\u00a0W. Tank. \u201cNeural\u201d computation of decisions in optimization problems. Biological cybernetics, 52(3):141\u2013152, 1985.","journal-title":"Biological cybernetics"},{"issue":"3","key":"9675_CR43","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1002\/jgt.21762","volume":"76","author":"H Huang","year":"2014","unstructured":"H.\u00a0Huang, N.\u00a0Linial, H.\u00a0Naves, Y.\u00a0Peled, and B.\u00a0Sudakov. On the 3-local profiles of graphs. Journal of Graph Theory, 76(3):236\u2013248, 2014.","journal-title":"Journal of Graph Theory"},{"issue":"5","key":"9675_CR44","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s00493-015-3051-9","volume":"36","author":"H Huang","year":"2016","unstructured":"H.\u00a0Huang, N.\u00a0Linial, H.\u00a0Naves, Y.\u00a0Peled, and B.\u00a0Sudakov. On the densities of cliques and independent sets in graphs. Combinatorica, 36(5):493\u2013512, 2016.","journal-title":"Combinatorica"},{"key":"9675_CR45","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01300130","volume":"16","author":"C Jagger","year":"1996","unstructured":"C.\u00a0Jagger, P. \u0160tov\u00ed\u010dek, and A.\u00a0Thomason. Multiplicities of subgraphs. Combinatorica, 16:123\u2013141, 1996.","journal-title":"Combinatorica"},{"key":"9675_CR46","doi-asserted-by":"crossref","unstructured":"N.\u00a0Kamcev, A.\u00a0Liebenau, and N.\u00a0Morrison. On uncommon systems of equations. arXiv preprintarXiv:2106.08986, 2021.","DOI":"10.1007\/978-3-030-83823-2_98"},{"key":"9675_CR47","unstructured":"N.\u00a0Kam\u010dev, A.\u00a0Liebenau, and N.\u00a0Morrison. Towards a characterisation of Sidorenko systems. arXiv preprintarXiv:2107.14413, 2021."},{"key":"9675_CR48","unstructured":"G.\u00a0Katona. A theorem of finite sets, pages 187\u2013207. Akad\u00e9mia Kiad\u00f3, Budapest, 1968."},{"issue":"4598","key":"9675_CR49","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"S.\u00a0Kirkpatrick, C.\u00a0D. Gelatt\u00a0Jr, and M.\u00a0P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671\u2013680, 1983.","journal-title":"Science"},{"key":"9675_CR50","doi-asserted-by":"crossref","unstructured":"J.\u00a0Kruskal. The number of simplicies in a complex, pages 251\u2013278. Univ. of California Press, 1963.","DOI":"10.1525\/9780520319875-014"},{"key":"9675_CR51","unstructured":"B.\u00a0Lidick\u1ef3 and F.\u00a0Pfender. Semidefinite programming and Ramsey numbers. arXiv preprintarXiv:1704.03592, 2017."},{"key":"9675_CR52","doi-asserted-by":"crossref","unstructured":"H.\u00a0Liu, O.\u00a0Pikhurko, and K.\u00a0Staden. The exact minimum number of triangles in graphs of given order and size, 2017. arXiv preprintarXiv:1712.00633, 2017.","DOI":"10.1016\/j.endm.2017.07.039"},{"key":"9675_CR53","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.jctb.2020.12.004","volume":"148","author":"X Liu","year":"2021","unstructured":"X.\u00a0Liu and D.\u00a0Mubayi. The feasible region of hypergraphs. Journal of Combinatorial Theory, Series B, 148:23\u201359, 2021.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9675_CR54","unstructured":"X.\u00a0Liu, D.\u00a0Mubayi, and C.\u00a0Reiher. The feasible region of induced graphs. arXiv preprintarXiv:2106.16203, 2021."},{"issue":"2","key":"9675_CR55","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1080\/00029890.1962.11989845","volume":"69","author":"G Lorden","year":"1962","unstructured":"G.\u00a0Lorden. Blue-empty chromatic graphs. The American Mathematical Monthly, 69(2):114\u2013120, 1962.","journal-title":"The American Mathematical Monthly"},{"key":"9675_CR56","doi-asserted-by":"crossref","unstructured":"L.\u00a0Lov\u00e1sz and M.\u00a0Simonovits. On the number of complete subgraphs of a graph II. In Studies in Pure Mathematics, pages 459\u2013495. Springer, 1983.","DOI":"10.1007\/978-3-0348-5438-2_41"},{"issue":"5","key":"9675_CR57","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.jcta.2011.12.004","volume":"119","author":"L Lu","year":"2012","unstructured":"L.\u00a0Lu and X.\u00a0Peng. Monochromatic $$4$$-term arithmetic progressions in $$2$$-colorings of $$\\mathbb{Z}_{n}$$. Journal of Combinatorial Theory, Series A, 119(5):1048\u20131065, 2012.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"9675_CR58","unstructured":"B.\u00a0McKay, 2024. Personal communication."},{"issue":"2","key":"9675_CR59","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/jctb.1996.1741","volume":"69","author":"BD McKay","year":"1997","unstructured":"B.\u00a0D. McKay and S.\u00a0P. Radziszowski. Subgraph counting identities and Ramsey numbers. Journal of Combinatorial Theory, Series B, 69(2):193\u2013209, 1997.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"9675_CR60","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"N.\u00a0Metropolis, A.\u00a0W. Rosenbluth, M.\u00a0N. Rosenbluth, A.\u00a0H. Teller, and E.\u00a0Teller. Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6):1087\u20131092, 1953.","journal-title":"The Journal of Chemical Physics"},{"key":"9675_CR61","unstructured":"S.\u00a0Nie\u00df. Counting monochromatic copies of $$K_4$$: a new lower bound for the Ramsey multiplicity problem. arXiv:1207.4714, 2012."},{"issue":"4","key":"9675_CR62","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0963548301004722","volume":"10","author":"V Nikiforov","year":"2001","unstructured":"V.\u00a0Nikiforov. On the minimum number of $$k$$-cliques in graphs with restricted independence number. Combinatorics, Probability and Computing, 10(4):361\u2013366, 2001.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"9675_CR63","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1090\/S0002-9947-2010-05189-X","volume":"363","author":"V Nikiforov","year":"2011","unstructured":"V.\u00a0Nikiforov. The number of cliques in graphs of given order and size. Transactions of the American Mathematical Society, 363(3):1599\u20131618, 2011.","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"9675_CR64","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1017\/S0963548316000110","volume":"26","author":"O Pikhurko","year":"2017","unstructured":"O.\u00a0Pikhurko and A.\u00a0Razborov. Asymptotic structure of graphs with the minimum number of triangles. Combinatorics, Probability and Computing, 26(1):138\u2013160, 2017.","journal-title":"Combinatorics, Probability and Computing"},{"key":"9675_CR65","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.jctb.2018.08.001","volume":"135","author":"O Pikhurko","year":"2019","unstructured":"O.\u00a0Pikhurko, J.\u00a0Slia\u010dan, and K.\u00a0Tyros. Strong forms of stability from flag algebra calculations. Journal of Combinatorial Theory, Series B, 135:129\u2013178, 2019.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"9675_CR66","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1017\/S0963548313000357","volume":"22","author":"O Pikhurko","year":"2013","unstructured":"O.\u00a0Pikhurko and E.\u00a0R. Vaughan. Minimum number of $$k$$-cliques in graphs with bounded independence number. Combinatorics, Probability and Computing, 22(6):910\u2013934, 2013.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"4","key":"9675_CR67","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"AA Razborov","year":"2007","unstructured":"A.\u00a0A. Razborov. Flag algebras. The Journal of Symbolic Logic, 72(4):1239\u20131282, 2007.","journal-title":"The Journal of Symbolic Logic"},{"issue":"4","key":"9675_CR68","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1017\/S0963548308009085","volume":"17","author":"AA Razborov","year":"2008","unstructured":"A.\u00a0A. Razborov. On the minimal density of triangles in graphs. Combinatorics, Probability and Computing, 17(4):603\u2013618, 2008.","journal-title":"Combinatorics, Probability and Computing"},{"key":"9675_CR69","doi-asserted-by":"crossref","unstructured":"C.\u00a0Reiher. The clique density theorem. Annals of Mathematics, pages 683\u2013707, 2016.","DOI":"10.4007\/annals.2016.184.3.1"},{"key":"9675_CR70","doi-asserted-by":"crossref","unstructured":"A.\u00a0Robertson and D.\u00a0Zeilberger. A 2-coloring of $$[1, n]$$ can have $$(n^2)\/22 + o(n)$$ monochromatic Schur triples, but not less! The Electronic Journal of Combinatorics, 5:R19, 1998.","DOI":"10.37236\/1357"},{"key":"9675_CR71","unstructured":"F.\u00a0Rowley. Improved lower bounds for multicolour Ramsey numbers using SAT-solvers. arXiv preprintarXiv:2203.13476, 2022."},{"issue":"2","key":"9675_CR72","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"1","author":"R Rubinstein","year":"1999","unstructured":"R.\u00a0Rubinstein. The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 1(2):127\u2013190, 1999.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"9675_CR73","unstructured":"R.\u00a0Y. Rubinstein and D.\u00a0P. Kroese. The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning, volume 133. Springer, 2004."},{"key":"9675_CR74","doi-asserted-by":"crossref","unstructured":"J.\u00a0Ru\u00e9 and C.\u00a0Spiegel. The Rado multiplicity problem in vector spaces over finite fields. arXiv preprintarXiv:2304.00400, 2023.","DOI":"10.5817\/CZ.MUNI.EUROCOMB23-108"},{"issue":"1","key":"9675_CR75","first-page":"125","volume":"68","author":"A Saad","year":"2017","unstructured":"A.\u00a0Saad and J.\u00a0Wolf. Ramsey multiplicity of linear patterns in certain finite abelian groups. The Quarterly Journal of Mathematics, 68(1):125\u2013140, 2017.","journal-title":"The Quarterly Journal of Mathematics"},{"key":"9675_CR76","unstructured":"W.\u00a0Sawin. An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem. arXiv preprintarXiv:2105.08850, 2021."},{"issue":"8","key":"9675_CR77","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1006\/eujc.1999.0297","volume":"20","author":"T Schoen","year":"1999","unstructured":"T.\u00a0Schoen. The number of monochromatic Schur triples. European Journal of Combinatorics, 20(8):855\u2013866, 1999.","journal-title":"European Journal of Combinatorics"},{"issue":"2","key":"9675_CR78","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02988307","volume":"9","author":"A Sidorenko","year":"1993","unstructured":"A.\u00a0Sidorenko. A correlation inequality for bipartite graphs. Graphs and Combinatorics, 9(2):201\u2013204, 1993.","journal-title":"Graphs and Combinatorics"},{"key":"9675_CR79","unstructured":"M.\u00a0K. Silva and C.\u00a0M. Sato. Flag algebras: A first glance. arXiv preprintarXiv:1607.04741, 2016."},{"issue":"1","key":"9675_CR80","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"K.\u00a0A. Smith. Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS Journal on Computing, 11(1):15\u201334, 1999.","journal-title":"INFORMS Journal on Computing"},{"key":"9675_CR81","unstructured":"K.\u00a0Sperfeld. On the minimal monochromatic $$K_4$$-density. arXiv preprintarXiv:1106.1030, 2011."},{"key":"9675_CR82","doi-asserted-by":"crossref","unstructured":"A.\u00a0Thomason. Pseudo-random graphs. In A.\u00a0Barlotti, M.\u00a0Biliotti, A.\u00a0Cossu, G.\u00a0Korchmaros, and G.\u00a0Tallini, editors, Annals of Discrete Mathematics (33), volume 144 of North-Holland Mathematics Studies, pages 307\u2013331. North-Holland, 1987.","DOI":"10.1016\/S0304-0208(08)73063-9"},{"issue":"2","key":"9675_CR83","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"2","author":"A Thomason","year":"1989","unstructured":"A.\u00a0Thomason. A disproof of a conjecture of Erd\u0151s in Ramsey theory. Journal of the London Mathematical Society, 2(2):246\u2013255, 1989.","journal-title":"Journal of the London Mathematical Society"},{"issue":"1","key":"9675_CR84","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01196136","volume":"17","author":"A Thomason","year":"1997","unstructured":"A.\u00a0Thomason. Graph products and monochromatic multiplicities. Combinatorica, 17(1):125\u2013134, 1997.","journal-title":"Combinatorica"},{"key":"9675_CR85","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"P.\u00a0Tur\u00e1n. On an external problem in graph theory. K\u00f6z\u00e9piskolai Matematikai \u00e9s Fizikai Lapok, 48:436\u2013452, 1941.","journal-title":"K\u00f6z\u00e9piskolai Matematikai \u00e9s Fizikai Lapok"},{"issue":"7524","key":"9675_CR86","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1038\/514550a","volume":"514","author":"R Van Noorden","year":"2014","unstructured":"R.\u00a0Van\u00a0Noorden, B.\u00a0Maher, and R.\u00a0Nuzzo. The top 100 papers. Nature News, 514(7524):550, 2014.","journal-title":"Nature News"},{"key":"9675_CR87","unstructured":"E.\u00a0Vaughan. Flagmatic: A tool for researchers in extremal graph theory. version 2.0, 2013."},{"key":"9675_CR88","unstructured":"L.\u00a0Versteegen. Common and Sidorenko equations in abelian groups. arXiv preprintarXiv:2109.04445, 2021."},{"key":"9675_CR89","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2023.105792","volume":"200","author":"L Versteegen","year":"2023","unstructured":"L.\u00a0Versteegen. Linear configurations containing 4-term arithmetic progressions are uncommon. Journal of Combinatorial Theory, Series A, 200:105792, 2023.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"9675_CR90","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2019.105130","volume":"169","author":"AZ Wagner","year":"2020","unstructured":"A.\u00a0Z. Wagner. Refuting conjectures in extremal combinatorics via linear programming. Journal of Combinatorial Theory, Series A, 169:105130, 2020.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"9675_CR91","unstructured":"A.\u00a0Z. Wagner. Constructions in combinatorics via neural networks. arXiv preprintarXiv:2104.14516, 2021."},{"issue":"1","key":"9675_CR92","doi-asserted-by":"crossref","first-page":"53","DOI":"10.4310\/JOC.2010.v1.n1.a4","volume":"1","author":"J Wolf","year":"2010","unstructured":"J.\u00a0Wolf. The minimum number of monochromatic $$4$$-term progressions in $$\\mathbb{Z}_p$$. Journal of Combinatorics, 1(1):53\u201368, 2010.","journal-title":"Journal of Combinatorics"},{"key":"9675_CR93","doi-asserted-by":"crossref","unstructured":"M.\u00a0Yamashita, K.\u00a0Fujisawa, M.\u00a0Fukuda, K.\u00a0Kobayashi, K.\u00a0Nakata, and M.\u00a0Nakata. Latest developments in the SDPA family for solving large-scale SDPs. In Handbook on semidefinite, conic and polynomial optimization, pages 687\u2013713. Springer, 2012.","DOI":"10.1007\/978-1-4614-0769-0_24"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-024-09675-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-024-09675-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-024-09675-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T23:26:25Z","timestamp":1761866785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-024-09675-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":93,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["9675"],"URL":"https:\/\/doi.org\/10.1007\/s10208-024-09675-6","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,26]]},"assertion":[{"value":"15 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}