{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:10:30Z","timestamp":1780107030837,"version":"3.54.0"},"reference-count":59,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:00:00Z","timestamp":1777075200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejc.2026.104391","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T07:17:49Z","timestamp":1777533469000},"page":"104391","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Some exact and asymptotic results for hypergraph Tur\u00e1n problems in \u21132-norm"],"prefix":"10.1016","volume":"136","author":[{"given":"George","family":"Brooks","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Linz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejc.2026.104391_b1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/S0963548399003909","article-title":"A counterexample to Kleitman\u2019s conjecture concerning an edge-isoperimetric problem","volume":"8","author":"Ahlswede","year":"1999","journal-title":"Comb. Probab. Comp."},{"key":"10.1016\/j.ejc.2026.104391_b2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01902206","article-title":"Graphs with maximal number of pairs of adjacent edges","volume":"32","author":"Ahlswede","year":"1978","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.ejc.2026.104391_b3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jcta.1996.0092","article-title":"The complete nontrivial-intersection theorem for systems of finite sets","volume":"76","author":"Ahlswede","year":"1996","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b4","series-title":"Surveys in Combinatorics","first-page":"21","article-title":"Hypergraph Tur\u00e1n problems in \u21132-norm","volume":"vol. 481","author":"Balogh","year":"2022"},{"issue":"1","key":"10.1016\/j.ejc.2026.104391_b5","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1112\/jlms.12568","article-title":"Solving Tur\u00e1n\u2019s tetrahedron problem for the \u21132-norm","volume":"106","author":"Balogh","year":"2022","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104391_b6","article-title":"Short proofs of three results about intersecting systems","volume":"4","author":"Balogh","year":"2024","journal-title":"Comb. Theory"},{"key":"10.1016\/j.ejc.2026.104391_b7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0012-365X(03)00130-4","article-title":"An upper bound on the sum of squares of degrees in a hypergraph","volume":"269","author":"Bey","year":"2003","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104391_b8","series-title":"General Theory of Information Transfer and Combinatorics","first-page":"971","article-title":"Remarks on an edge isoperimetric problem","volume":"vol. 4123","author":"Bey","year":"2006"},{"key":"10.1016\/j.ejc.2026.104391_b9","unstructured":"J. Byrne, D.N. Desai, M. Tait, A general theorem in spectral extremal graph theory. preprint available at arXiv:2401.07266."},{"key":"10.1016\/j.ejc.2026.104391_b10","unstructured":"Y. Caro, R. Yuster, A Tur\u00e1n type problem concerning the powers of the degrees of a graph(revised). available at arXiv:0401398."},{"key":"10.1016\/j.ejc.2026.104391_b11","doi-asserted-by":"crossref","DOI":"10.37236\/1525","article-title":"A Tur\u00e1n type problem concerning the powers of the degrees of a graph","volume":"7","author":"Caro","year":"2000","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104391_b12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1112\/jlms\/s2-9.2.355","article-title":"An extremal set-intersection theorem","volume":"9","author":"Chv\u00e1tal","year":"1974","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.ejc.2026.104391_b13","doi-asserted-by":"crossref","DOI":"10.1137\/22M150650X","article-title":"A spectral Erd\u0151s-S\u00f3s theorem","volume":"37","author":"Cioab\u0103","year":"2023","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.ejc.2026.104391_b14","article-title":"The spectral even cycle problem","volume":"4","author":"Cioab\u0103","year":"2024","journal-title":"Comb. Theory"},{"key":"10.1016\/j.ejc.2026.104391_b15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018630111976","article-title":"A homological approach to two problems on finite sets","volume":"9","author":"Cs\u00e1k\u00e1ny","year":"1999","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.ejc.2026.104391_b16","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00493-020-4441-1","article-title":"New results on simplex-clusters in set systems","volume":"41","author":"Currier","year":"2021","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2021.105464","article-title":"On the d-cluster generalization of Erd\u0151s-Ko-Rado","volume":"182","author":"Currier","year":"2021","journal-title":"J. Comb. Theory Ser. A"},{"issue":"6","key":"10.1016\/j.ejc.2026.104391_b18","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s00493-014-3133-0","article-title":"The minimum number of disjoint pairs in set systems and related problems","volume":"36","author":"Das","year":"2015","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b19","first-page":"5","article-title":"Extension of a theorem of Moon and Moser on complete subgraphs","volume":"16","author":"de Caen","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/j.ejc.2026.104391_b20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(97)00213-6","article-title":"An upper bound on the sum of squares of degrees in a graph","volume":"185","author":"de Caen","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104391_b21","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1006\/jctb.1999.1938","article-title":"The maximum size of 3-uniform hypergraphs not containing a Fano plane","volume":"78","author":"de Caen","year":"2000","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.ejc.2026.104391_b22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02759942","article-title":"On extremal problems of graphs and generalized graphs","volume":"2","author":"Erd\u0151s","year":"1964","journal-title":"Israel J. Math."},{"key":"10.1016\/j.ejc.2026.104391_b23","first-page":"93","article-title":"A problem on independent r-tuples","volume":"8","author":"Erd\u0151s","year":"1965","journal-title":"Ann. Univ. Sci. Bp."},{"key":"10.1016\/j.ejc.2026.104391_b24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"12","author":"Erd\u0151s","year":"1961","journal-title":"Quart. J. Math. Oxf. Ser. (2)"},{"key":"10.1016\/j.ejc.2026.104391_b25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits of a graph","volume":"9","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/j.ejc.2026.104391_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(76)90073-X","article-title":"Sperner families satisfying an additional condition","volume":"20","author":"Frankl","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b27","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0097-3165(78)90003-1","article-title":"On intersecting families of finite sets","volume":"24","author":"Frankl","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b28","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1016\/j.jcta.2013.01.008","article-title":"Improved bounds for Erd\u0151s\u2019 matching conjecture","volume":"120","author":"Frankl","year":"2013","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b29","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(87)90016-1","article-title":"Exact solution of some Tur\u00e1n-type problems","volume":"45","author":"Frankl","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b30","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1112\/jlms.12041","article-title":"Families with no s pairwise disjoint sets","volume":"95","author":"Frankl","year":"2017","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104391_b31","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.jctb.2022.08.002","article-title":"The Erd\u0151s matching conjecture and concentration inequalities","volume":"157","author":"Frankl","year":"2022","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104391_b32","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.jcta.2013.12.009","article-title":"Hypergraph Tur\u00e1n numbers of linear cycles","volume":"123","author":"F\u00fcredi","year":"2014","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b33","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00493-014-2838-4","article-title":"Exact solution of the hypergraph Tur\u00e1n problem for k-uniform linear paths","volume":"34","author":"F\u00fcredi","year":"2014","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b34","first-page":"12","article-title":"On degree powers and counting stars in F-free graphs","volume":"127","author":"Gerbner","year":"2025","journal-title":"European J. Combin."},{"issue":"1","key":"10.1016\/j.ejc.2026.104391_b35","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","article-title":"Lower bounds for constant weight codes","volume":"26","author":"Graham","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/j.ejc.2026.104391_b36","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s11856-021-2132-2","article-title":"Lagrangians of hypergraphs II: When colex is best","volume":"242","author":"Gruslys","year":"2021","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.ejc.2026.104391_b37","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0012-365X(91)90253-X","article-title":"On a problem of Kleitman and West","volume":"93","author":"Harper","year":"1991","journal-title":"Disc. Math."},{"key":"10.1016\/j.ejc.2026.104391_b38","series-title":"Global Methods for Combinatorial Isoperimetric Problems","author":"Harper","year":"2004"},{"issue":"1","key":"10.1016\/j.ejc.2026.104391_b39","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","article-title":"Some intersection theorems for systems of finite sets","volume":"18","author":"Hilton","year":"1967","journal-title":"Q. J. Math."},{"key":"10.1016\/j.ejc.2026.104391_b40","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/mana.19881390105","article-title":"Spectral radius and degree sequence","volume":"139","author":"Hofmeister","year":"1988","journal-title":"Math. Nachr."},{"key":"10.1016\/j.ejc.2026.104391_b41","series-title":"Surveys in Combinatorics 2011","first-page":"83","article-title":"Hypergraph Tur\u00e1n problems","volume":"392","author":"Keevash","year":"2011"},{"key":"10.1016\/j.ejc.2026.104391_b42","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00493-010-2401-x","article-title":"Set systems without a simplex or cluster","volume":"30","author":"Keevash","year":"2010","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b43","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.jcta.2014.09.005","article-title":"Tur\u00e1n problems and shadows I: Paths and cycles","volume":"129","author":"Kostochka","year":"2015","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2019.105139","article-title":"On set systems without a simplex-cluster and the junta method","volume":"170","author":"Lifshitz","year":"2020","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b45","series-title":"A spectral Erd\u0151s-P\u00f3sa theorem","author":"Liu","year":"2022"},{"key":"10.1016\/j.ejc.2026.104391_b46","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.jcta.2005.04.001","article-title":"Erd\u0151s-Ko-Rado for three sets","volume":"113","author":"Mubayi","year":"2006","journal-title":"J. Combin. Theory Ser. A"},{"issue":"5","key":"10.1016\/j.ejc.2026.104391_b47","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s00493-005-0036-0","article-title":"Proof of a conjecture of Erd\u0151s on triangles in set-systems","volume":"25","author":"Mubayi","year":"2005","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b48","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1016\/j.ejc.2006.07.001","article-title":"Minimal paths and cycles in set-systems","volume":"28","author":"Mubayi","year":"2007","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104391_b49","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548301004928","article-title":"Some inequalities for the largest eigenvalue of a graph","volume":"11","author":"Nikiforov","year":"2002","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104391_b50","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.laa.2007.07.010","article-title":"Bounds on graph eigenvalues II","volume":"427","author":"Nikiforov","year":"2007","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.ejc.2026.104391_b51","article-title":"Degree powers in graphs with a forbidden even cycle","volume":"16","author":"Nikiforov","year":"2009","journal-title":"Elect. J. Comb."},{"issue":"2","key":"10.1016\/j.ejc.2026.104391_b52","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1016\/j.laa.2009.05.023","article-title":"The spectral radius of graphs without paths and cycles of specified length","volume":"432","author":"Nikiforov","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.ejc.2026.104391_b53","first-page":"12","article-title":"Non-trivial d-wise intersecting families","volume":"178","author":"O\u2019Neill","year":"2021","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"10.1016\/j.ejc.2026.104391_b54","doi-asserted-by":"crossref","DOI":"10.7494\/OpMath.2017.37.4.597","article-title":"A hierarchy of maximal triple intersecting systems","volume":"37","author":"Polcyn","year":"2017","journal-title":"Opuscula Math."},{"key":"10.1016\/j.ejc.2026.104391_b55","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jcta.2019.02.018","article-title":"The colin de Verdi\u00e9re parameter, excluded minors and the spectral radius","volume":"166","author":"Tait","year":"2019","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104391_b56","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jctb.2017.04.006","article-title":"Three conjectures in extremal spectral graph theory","volume":"126","author":"Tait","year":"2017","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"10.1016\/j.ejc.2026.104391_b57","first-page":"1","article-title":"Pseudorandomness","volume":"7","author":"Vadhan","year":"2011","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.ejc.2026.104391_b58","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579226","article-title":"The exact bound in the Erd\u0151s-Ko-Rado theorem","volume":"4","author":"Wilson","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104391_b59","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.jctb.2022.07.002","article-title":"Spectral extrema of Ks,t-minor-free graphs - on a conjecture of M. Tait","volume":"157","author":"Zhai","year":"2022","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000594?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000594?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T01:48:03Z","timestamp":1780105683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":59,"alternative-id":["S0195669826000594"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104391","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some exact and asymptotic results for hypergraph Tur\u00e1n problems in -norm","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104391","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104391"}}