{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T08:24:50Z","timestamp":1751531090664},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00493-020-4499-9","type":"journal-article","created":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:24:41Z","timestamp":1645183481000},"page":"87-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Non-Bipartite K-Common Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Jonathan A.","family":"Noel","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Norin","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Volec","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,18]]},"reference":[{"key":"4499_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/jgt.3190040403","volume":"4","author":"S A Burr","year":"1980","unstructured":"S. A. Burr and V. Rosta: On the Ramsey multiplicities of graphs \u2014 problems and recent results, J. Graph Theory 4 (1980), 347\u2013361.","journal-title":"J. Graph Theory"},{"key":"4499_CR2","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1007\/s00039-010-0097-0","volume":"20","author":"D Conlon","year":"2010","unstructured":"D. Conlon, J. Fox and B. Sudakov: An approximate version of Sidorenko\u2019s conjecture, Geom. Funct. Anal. 20 (2010), 1354\u20131366.","journal-title":"Geom. Funct. Anal."},{"key":"4499_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1112\/jlms.12142","volume":"98","author":"D Conlon","year":"2018","unstructured":"D. Conlon, J. H. Kim, C. Lee and J. Lee: Some advances on Sidorenko\u2019s conjecture, J. Lond. Math. Soc. 98 (2018), 593\u2013608.","journal-title":"J. Lond. Math. Soc."},{"key":"4499_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.aim.2017.05.009","volume":"315","author":"D Conlon","year":"2017","unstructured":"D. Conlon and J. Lee: Finite reflection groups and graph norms, Adv. Math. 315 (2017), 130\u2013165.","journal-title":"Adv. Math."},{"key":"4499_CR5","unstructured":"D. Conlon and J. Lee: Sidorenko\u2019s conjecture for blow-ups, Anal. 2021, Paper No. 2."},{"key":"4499_CR6","unstructured":"E. Cs\u00f3ka, T. Hubai and L. Lov\u00e1sz: Locally common graphs (2019), preprint arXiv:1912.02926."},{"key":"4499_CR7","first-page":"1","volume":"2","author":"J Cummings","year":"2011","unstructured":"J. Cummings and M. Young: Graphs containing triangles are not 3-common, J. Comb. 2 (2011), 1\u201314.","journal-title":"J. Comb."},{"key":"4499_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u0151s","year":"1947","unstructured":"P. Erd\u0151s: Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc."},{"key":"4499_CR9","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s: On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7 (1962), 459\u2013464.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"4499_CR10","unstructured":"P. Erd\u0151s and M. Simonovits: Cube-supersaturated graphs and related problems, in: Progress in graph theory (Waterloo, Ont., 1982) (1984), 203\u2013218."},{"key":"4499_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/jgt.20256","volume":"57","author":"J Fox","year":"2008","unstructured":"J. Fox: There exist graphs with super-exponential ramsey multiplicity constant, Journal of Graph Theory 57 (2008), 89\u201398.","journal-title":"Journal of Graph Theory"},{"key":"4499_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.endm.2017.06.074","volume":"61","author":"J Fox","year":"2017","unstructured":"J. Fox and F. Wei: On the local approach to Sidorenko\u2019s conjecture, Electronic Notes in Discrete Mathematics 61 (2017), 459\u2013465.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"4499_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930200024","volume":"22","author":"F Franek","year":"2002","unstructured":"F. Franek: On Erd\u0151s\u2019s conjecture on multiplicities of complete subgraphs: lower upper bound for cliques of size 6, Combinatorica 22 (2002), 451\u2013454.","journal-title":"Combinatorica"},{"key":"4499_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0012-365X(93)90366-2","volume":"114","author":"F Franek","year":"1993","unstructured":"F. Franek and V. R\u00f6dl: 2-colorings of complete graphs with a small number of monochromatic K4 subgraphs, Discrete Math. 114 (1993), 199\u2013203. Combinatorics and algorithms (Jerusalem, 1988).","journal-title":"Discrete Math."},{"key":"4499_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A Frieze","year":"1999","unstructured":"A. Frieze and R. Kannan: Quick approximation to matrices and applications, Combinatorica 19 (1999), 175\u2013220.","journal-title":"Combinatorica"},{"key":"4499_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0095-8956(79)90016-9","volume":"27","author":"G Giraud","year":"1979","unstructured":"G. Giraud: Sur le probl\u00e8me de Goodman pour les quadrangles et la majoration des nombres de Ramsey, J. Combin. Theory Ser. B 27 (1979), 237\u2013253.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4499_CR17","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1080\/00029890.1959.11989408","volume":"66","author":"A W Goodman","year":"1959","unstructured":"A. W. Goodman: On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778\u2013783.","journal-title":"Amer. Math. Monthly"},{"key":"4499_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11856-010-0005-1","volume":"175","author":"H Hatami","year":"2010","unstructured":"H. Hatami: Graph norms and Sidorenko\u2019s conjecture, Israel J. Math. 175 (2010), 125\u2013150.","journal-title":"Israel J. Math."},{"key":"4499_CR19","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1017\/S0963548312000107","volume":"21","author":"H Hatami","year":"2012","unstructured":"H. Hatami, J. Hladk\u00fd, D. Kr\u00e1l, S. Norine and A. Razborov: Non-three-colourable common graphs exist, Combin. Probab. Comput. 21 (2012), 734\u2013742.","journal-title":"Combin. Probab. Comput."},{"key":"4499_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01300130","volume":"16","author":"C Jagger","year":"1996","unstructured":"C. Jagger, P. \u0160tov\u00ed\u010dek and A. Thomason: Multiplicities of subgraphs, Combinatorica 16 (1996), 123\u2013141.","journal-title":"Combinatorica"},{"key":"4499_CR21","unstructured":"J. L. Li and B. Szegedy: On the logarithimic calculus and Sidorenko\u2019s conjecture (2011), preprint arXiv:1107.1153, accepted to Combinatorica."},{"key":"4499_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/00029890.1962.11989845","volume":"69","author":"G Lorden","year":"1962","unstructured":"G. Lorden: Blue-empty chromatic graphs, Amer. Math. Monthly 69 (1962), 114\u2013120.","journal-title":"Amer. Math. Monthly"},{"key":"4499_CR23","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz: Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture, Electron. J. Combin. 18 (2011), Paper 127, 21.","DOI":"10.37236\/614"},{"key":"4499_CR24","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz: Large networks and graph limits, AMS Colloquium Publications, volume 60, 2012.","DOI":"10.1090\/coll\/060"},{"key":"4499_CR25","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L Lov\u00e1sz","year":"2006","unstructured":"L. Lov\u00e1sz and B. Szegedy: Limits of dense graph sequences, J. Combin. Theory Ser. B 96 (2006), 933\u2013957.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4499_CR26","unstructured":"S. Niess: Counting monochromatic copies of K4: a new lower bound for the ramsey multiplicity problem (2012), preprint arXiv:1207.4714."},{"key":"4499_CR27","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"A A Razborov","year":"2007","unstructured":"A. A. Razborov: Flag algebras, J. Symbolic Logic 72 (2007), 1239\u20131282.","journal-title":"J. Symbolic Logic"},{"key":"4499_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02988307","volume":"9","author":"A Sidorenko","year":"1993","unstructured":"A. Sidorenko: A correlation inequality for bipartite graphs, Graphs Combin. 9 (1993), 201\u2013204.","journal-title":"Graphs Combin."},{"key":"4499_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<229::AID-RSA6>3.0.CO;2-#","volume":"8","author":"A Sidorenko","year":"1996","unstructured":"A. Sidorenko: Randomness friendly graphs, Random Structures Algorithms 8 (1996), 229\u2013241.","journal-title":"Random Structures Algorithms"},{"key":"4499_CR30","first-page":"72","volume":"46","author":"A F Sidorenko","year":"1989","unstructured":"A. F. Sidorenko: Cycles in graphs and functional inequalities, Mat. Zametki 46 (1989), 72\u201379, 104.","journal-title":"Mat. Zametki"},{"key":"4499_CR31","first-page":"50","volume":"3","author":"A F Sidorenko","year":"1991","unstructured":"A. F. Sidorenko: Inequalities for functionals generated by bipartite graphs, Diskret. Mat. 3 (1991), 50\u201365.","journal-title":"Diskret. Mat."},{"key":"4499_CR32","unstructured":"K. Sperfeld: On the minimal monochromatic K4-density (2011), preprint arXiv:1106.1030."},{"key":"4499_CR33","unstructured":"B. Szegedy: An information theoretic approach to Sidorenko\u2019s conjecture (2015), preprint arXiv:1406.6738."},{"key":"4499_CR34","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"39","author":"A Thomason","year":"1989","unstructured":"A. Thomason: A disproof of a conjecture of Erd\u0151s in Ramsey theory, J. London Math. Soc. 39 (1989), 246\u2013255.","journal-title":"J. London Math. Soc."},{"key":"4499_CR35","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01196136","volume":"17","author":"A Thomason","year":"1997","unstructured":"A. Thomason: Graph products and monochromatic multiplicities, Combinatorica 17 (1997), 125\u2013134.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4499-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T18:07:21Z","timestamp":1653329241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4499-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4499"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4499-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"30 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}