{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T17:05:02Z","timestamp":1780679102855,"version":"3.54.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371344"],"award-info":[{"award-number":["12371344"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071097"],"award-info":[{"award-number":["12071097"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.jcta.2026.106201","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:28:05Z","timestamp":1776284885000},"page":"106201","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Spectral bounds for the independence number of graphs and even uniform hypergraphs"],"prefix":"10.1016","volume":"223","author":[{"given":"Xinyu","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changjiang","family":"Bu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2026.106201_br0010","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1080\/03081087.2024.2382992","article-title":"Constructing cospectral hypergraphs","volume":"73","author":"Abiad","year":"2025","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.jcta.2026.106201_br0020","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/PL00009824","article-title":"The Shannon capacity of a union","volume":"18","author":"Alon","year":"1998","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcta.2026.106201_br0030","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s11856-019-1880-8","article-title":"The theta number of simplicial complexes","volume":"232","author":"Bachoc","year":"2019","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.jcta.2026.106201_br0040","series-title":"Generalized Inverses: Theory and Applications","author":"Ben-Israel","year":"2003"},{"key":"10.1016\/j.jcta.2026.106201_br0050","series-title":"Spectra of Graphs","author":"Brouwer","year":"2012"},{"key":"10.1016\/j.jcta.2026.106201_br0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2024.105909","article-title":"Spectra of power hypergraphs and signed graphs via parity-closed walks","volume":"207","author":"Chen","year":"2024","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2026.106201_br0070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2021.01.002","article-title":"A Harary-Sachs theorem for hypergraphs","volume":"149","author":"Clark","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcta.2026.106201_br0080","doi-asserted-by":"crossref","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","article-title":"Spectra of uniform hypergraphs","volume":"436","author":"Cooper","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.jcta.2026.106201_br0090","series-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107","year":"2010"},{"key":"10.1016\/j.jcta.2026.106201_br0100","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Res. Rep., Suppl."},{"key":"10.1016\/j.jcta.2026.106201_br0110","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1002\/jgt.22801","article-title":"Maximum spectral radius of outerplanar 3-uniform hypergraphs","volume":"100","author":"Ellingham","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jcta.2026.106201_br0120","doi-asserted-by":"crossref","first-page":"841","DOI":"10.4171\/jems\/320","article-title":"Triangle-intersecting families of graphs","volume":"14","author":"Ellis","year":"2012","journal-title":"J. Eur. Math. Soc."},{"key":"10.1016\/j.jcta.2026.106201_br0130","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1090\/S0894-0347-2011-00690-5","article-title":"Intersecting families of permutations","volume":"24","author":"Ellis","year":"2011","journal-title":"J. Am. Math. Soc."},{"key":"10.1016\/j.jcta.2026.106201_br0140","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1090\/tran\/7741","article-title":"The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs","volume":"372","author":"Fan","year":"2019","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.jcta.2026.106201_br0150","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1137\/21M1404740","article-title":"Spectral radius on linear r-graphs without expanded Kr+1","volume":"36","author":"Gao","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jcta.2026.106201_br0160","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.jctb.2007.10.007","article-title":"Eigenvalue bounds for independent sets","volume":"98","author":"Godsil","year":"2008","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcta.2026.106201_br0170","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1007\/s00493-016-3137-z","article-title":"On the chromatic number of a simplicial complex","volume":"37","author":"Golubev","year":"2017","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcta.2026.106201_br0180","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","article-title":"Interlacing eigenvalues and graphs","volume":"226\u2013228","author":"Haemers","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.jcta.2026.106201_br0190","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1090\/proc\/14274","article-title":"On the first and second eigenvalue of finite and infinite uniform hypergraphs","volume":"147","author":"Li","year":"2019","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.jcta.2026.106201_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113915","article-title":"On a relationship between the characteristic and matching polynomials of a uniform hypertree","volume":"347","author":"Li","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2026.106201_br0210","series-title":"Proceedings 1st IEEE International Workshop on Computational Advances of Multitensor Adaptive Processing. Vol. 1","first-page":"129","article-title":"Singular values and eigenvalues of tensors: a variational approach","author":"Lim","year":"2005"},{"key":"10.1016\/j.jcta.2026.106201_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106201_br0230","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","article-title":"Eigenvalues of a real supersymmetric tensor","volume":"40","author":"Qi","year":"2005","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jcta.2026.106201_br0240","doi-asserted-by":"crossref","first-page":"2359","DOI":"10.1080\/03081087.2015.1009061","article-title":"Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs","volume":"63","author":"Shao","year":"2015","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.jcta.2026.106201_br0250","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero-error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106201_br0260","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ejc.2003.09.008","article-title":"Independence numbers of hypergraphs with sparse neighborhoods","volume":"25","author":"Zhou","year":"2004","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jcta.2026.106201_br0270","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4153\/S0008414X23000822","article-title":"Unified bounds for the independence number of graphs","volume":"77","author":"Zhou","year":"2025","journal-title":"Can. J. Math."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:47:21Z","timestamp":1780678041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316526000440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":27,"alternative-id":["S0097316526000440"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106201","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Spectral bounds for the independence number of graphs and even uniform hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106201","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106201"}}