{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:44:20Z","timestamp":1785786260127,"version":"3.56.0"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100013507","name":"Oskar Huttunen Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013507","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"publisher","award":["2023-03375"],"award-info":[{"award-number":["2023-03375"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.jctb.2025.11.003","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T02:37:25Z","timestamp":1763692645000},"page":"186-215","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Bisection width, discrepancy, and eigenvalues of hypergraphs"],"prefix":"10.1016","volume":"177","author":[{"given":"Eero","family":"R\u00e4ty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Istv\u00e1n","family":"Tomon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2025.11.003_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548301004965","article-title":"On the edge-expansion of graphs","volume":"11","author":"Alon","year":"1993","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.jctb.2025.11.003_br0020","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1006\/eujc.1998.0295","article-title":"Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs","volume":"20","author":"Alon","year":"1999","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.11.003_br0030","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.laa.2020.01.012","article-title":"On the spectrum of hypergraphs","volume":"614","author":"Banerjee","year":"2021","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"10.1016\/j.jctb.2025.11.003_br0040","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0195-6698(88)80014-3","article-title":"The isoperimetric number of random regular graphs","volume":"9","author":"Bollob\u00e1s","year":"1988","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.11.003_br0050","series-title":"More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal","first-page":"33","article-title":"Discrepancy in graphs and hypergraphs","author":"Bollob\u00e1s","year":"2006"},{"key":"10.1016\/j.jctb.2025.11.003_br0060","article-title":"Polynomials and Polynomial Inequalities","volume":"vol. 161","author":"Borwein","year":"1995"},{"key":"10.1016\/j.jctb.2025.11.003_br0070","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-024-02774-9","article-title":"A note on internal partitions: the 5-regular case and beyond","volume":"40","author":"B\u00e4rnkopf","year":"2024","journal-title":"Graphs Comb."},{"issue":"6","key":"10.1016\/j.jctb.2025.11.003_br0080","doi-asserted-by":"crossref","first-page":"2118","DOI":"10.1137\/18M1163865","article-title":"Minimum cuts and sparsification in hypergraphs","volume":"47","author":"Chekuri","year":"2018","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.11.003_br0090","series-title":"Expanding Graphs","first-page":"21","article-title":"The Laplacian of a hypergraph","volume":"vol. 10","author":"Chung","year":"1993"},{"key":"10.1016\/j.jctb.2025.11.003_br0100","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.jctb.2025.11.003_br0110","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/S0304-3975(03)00236-6","article-title":"Bounds on the max and min bisection of random cubic and random 4-regular graphs","volume":"307","author":"D\u00edaz","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jctb.2025.11.003_br0120","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.tcs.2007.03.003","article-title":"Bounds on the bisection width for random d-regular graphs","volume":"382","author":"D\u00edaz","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jctb.2025.11.003_br0130","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190120113","article-title":"Cutting a graph into two dissimilar halves","volume":"12","author":"Erd\u0151s","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2025.11.003_br0140","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230010407","article-title":"Imbalances in k-colorations","volume":"1","author":"Erd\u0151s","year":"1971","journal-title":"Networks"},{"key":"10.1016\/j.jctb.2025.11.003_br0150","series-title":"41st IEEE Annual Symposium on Foundation of Computer Science","first-page":"23","article-title":"A polylogarithmic approximation of the minimum bisection","author":"Feige","year":"2000"},{"key":"10.1016\/j.jctb.2025.11.003_br0160","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jnth.1996.0109","article-title":"Spectra of hypergraphs and applications","volume":"60","author":"Feng","year":"1996","journal-title":"J. Number Theory"},{"issue":"5","key":"10.1016\/j.jctb.2025.11.003_br0170","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1137\/0220058","article-title":"The spectra of infinite hypertrees","volume":"20","author":"Friedman","year":"1991","journal-title":"SIAM J. Comput."},{"issue":"910","key":"10.1016\/j.jctb.2025.11.003_br0180","article-title":"A proof of Alon's second eigenvalue conjecture and related problems","volume":"195","author":"Friedman","year":"2008","journal-title":"Mem. Am. Math. Soc."},{"issue":"1","key":"10.1016\/j.jctb.2025.11.003_br0190","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01294459","article-title":"On the second eigenvalue of hypergraphs","volume":"15","author":"Friedman","year":"1995","journal-title":"Combinatorica"},{"issue":"6","key":"10.1016\/j.jctb.2025.11.003_br0200","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.jctb.2025.11.003_br0210","series-title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"3089","article-title":"Deterministic near-linear time minimum cut in weighted graphs","author":"Henzinger","year":"2024"},{"issue":"1","key":"10.1016\/j.jctb.2025.11.003_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/18M1180335","article-title":"Local flow partitioning for faster edge connectivity","volume":"49","author":"Henzinger","year":"2020","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.jctb.2025.11.003_br0230","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","article-title":"Expander graphs and their applications","volume":"43","author":"Hoory","year":"2006","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"10.1016\/j.jctb.2025.11.003_br0240","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10878-013-9596-x","article-title":"The Laplacian of a uniform hypergraph","volume":"29","author":"Hu","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.jctb.2025.11.003_br0250","series-title":"1991 IEEE International Symposium on Circuits and Systems (ISCAS)","first-page":"1160","article-title":"A fast heuristic algorithm for hypergraph bisection","author":"Kamidoi","year":"1991"},{"key":"10.1016\/j.jctb.2025.11.003_br0260","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC '96","first-page":"56","article-title":"Minimum cuts in near-linear time","author":"Karger","year":"1996"},{"issue":"1","key":"10.1016\/j.jctb.2025.11.003_br0270","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3274663","article-title":"Deterministic edge connectivity in near-linear time","volume":"66","author":"Kawarabayashi","year":"2019","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.jctb.2025.11.003_br0280","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1137\/130929370","article-title":"Spectral extremal problems for hypergraphs","volume":"28","author":"Keevash","year":"2014","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2025.11.003_br0290","series-title":"Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity","first-page":"151","article-title":"On bounds of the bisection width of cubic graphs","author":"Kostochka","year":"1992"},{"issue":"e2","key":"10.1016\/j.jctb.2025.11.003_br0300","first-page":"26pp","article-title":"Eigenvalues and linear quasirandom hypergraphs","volume":"3","author":"Lenz","year":"2015","journal-title":"Forum Math. Sigma"},{"key":"10.1016\/j.jctb.2025.11.003_br0310","doi-asserted-by":"crossref","unstructured":"J. Li, Deterministic mincut in almost-linear time, in: S. Khuller, V.V. Williams (Eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21\u201325, 2021, pp. 384\u2013395.","DOI":"10.1145\/3406325.3451114"},{"key":"10.1016\/j.jctb.2025.11.003_br0320","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.jctb.2025.11.003_br0330","series-title":"Mathematical Foundations of Computer Science","first-page":"524","article-title":"Upper bounds on the bisection width of 3 and 4-regular graphs","volume":"vol. 2136","author":"Monien","year":"2001"},{"issue":"2","key":"10.1016\/j.jctb.2025.11.003_br0340","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","article-title":"On the second eigenvalue of a graph","volume":"91","author":"Nilli","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2025.11.003_br0350","series-title":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA '18)","first-page":"23","article-title":"Trees for vertex cuts, hypergraph cuts and minimum hypergraph bisection","author":"R\u00e4cke","year":"2018"},{"key":"10.1016\/j.jctb.2025.11.003_br0360","author":"R\u00e4ty"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T17:30:19Z","timestamp":1767029419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895625000863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":36,"alternative-id":["S0095895625000863"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2025.11.003","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bisection width, discrepancy, and eigenvalues of hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2025.11.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}