[{"volume":46,"scopus_import":"1","month":"02","publication_identifier":{"issn":["0209-9683"],"eissn":["1439-6912"]},"oa":1,"arxiv":1,"acknowledgement":"We would like to thank the referees for a number of helpful comments and suggestions, which have substantially improved the paper. Open access funding provided by Institute of Science and Technology (IST Austria).","author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567"},{"id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","first_name":"Roodabeh","last_name":"Safavi Hemami","full_name":"Safavi Hemami, Roodabeh"},{"orcid":"0000-0002-2856-767X","full_name":"Wang, Yiting","last_name":"Wang","first_name":"Yiting","id":"1917d194-076e-11ed-97cd-837255f88785"}],"language":[{"iso":"eng"}],"citation":{"ieee":"M. A. Kwan, R. Safavi Hemami, and Y. Wang, “Counting perfect matchings in Dirac hypergraphs,” <i>Combinatorica</i>, vol. 46. Springer Nature, 2026.","mla":"Kwan, Matthew Alan, et al. “Counting Perfect Matchings in Dirac Hypergraphs.” <i>Combinatorica</i>, vol. 46, 5, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s00493-025-00194-8\">10.1007/s00493-025-00194-8</a>.","apa":"Kwan, M. A., Safavi Hemami, R., &#38; Wang, Y. (2026). Counting perfect matchings in Dirac hypergraphs. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-025-00194-8\">https://doi.org/10.1007/s00493-025-00194-8</a>","ama":"Kwan MA, Safavi Hemami R, Wang Y. Counting perfect matchings in Dirac hypergraphs. <i>Combinatorica</i>. 2026;46. doi:<a href=\"https://doi.org/10.1007/s00493-025-00194-8\">10.1007/s00493-025-00194-8</a>","ista":"Kwan MA, Safavi Hemami R, Wang Y. 2026. Counting perfect matchings in Dirac hypergraphs. Combinatorica. 46, 5.","chicago":"Kwan, Matthew Alan, Roodabeh Safavi Hemami, and Yiting Wang. “Counting Perfect Matchings in Dirac Hypergraphs.” <i>Combinatorica</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00493-025-00194-8\">https://doi.org/10.1007/s00493-025-00194-8</a>.","short":"M.A. Kwan, R. Safavi Hemami, Y. Wang, Combinatorica 46 (2026)."},"article_processing_charge":"Yes (via OA deal)","day":"01","quality_controlled":"1","OA_type":"hybrid","OA_place":"publisher","publication":"Combinatorica","abstract":[{"lang":"eng","text":"One of the foundational theorems of extremal graph theory is Dirac’s theorem, which\r\nsays that if an n-vertex graph G has minimum degree at least n/2, then G has a\r\nHamilton cycle, and therefore a perfect matching (if n is even). Later work by Sárközy,\r\nSelkow and Szemerédi showed that in fact Dirac graphs have many Hamilton cycles\r\nand perfect matchings, culminating in a result of Cuckler and Kahn that gives a precise\r\ndescription of the numbers of Hamilton cycles and perfect matchings in a Dirac graph\r\nG (in terms of an entropy-like parameter of G). In this paper we extend Cuckler\r\nand Kahn’s result to perfect matchings in hypergraphs. For positive integers d < k,\r\nand for n divisible by k, let md (k, n) be the minimum d-degree that ensures the\r\nexistence of a perfect matching in an n-vertex k-uniform hypergraph. In general, it is\r\nan open question to determine (even asymptotically) the values of md (k, n), but we are\r\nnonetheless able to prove an analogue of the Cuckler–Kahn theorem, showing that if\r\nan n-vertex k-uniform hypergraph G has minimum d-degree at least (1+γ )md (k, n)\r\n(for any constantγ > 0), then the number of perfect matchings in G is controlled by\r\nan entropy-like parameter of G. This strengthens cruder estimates arising from work\r\nof Kang–Kelly–Kühn–Osthus–Pfenninger and Pham–Sah–Sawhney–Simkin."}],"intvolume":"        46","has_accepted_license":"1","publication_status":"published","corr_author":"1","title":"Counting perfect matchings in Dirac hypergraphs","ddc":["510"],"year":"2026","license":"https://creativecommons.org/licenses/by/4.0/","article_type":"original","type":"journal_article","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-08T23:02:49Z","status":"public","date_published":"2026-02-01T00:00:00Z","department":[{"_id":"MaKw"},{"_id":"MoHe"}],"external_id":{"arxiv":["2408.09589"]},"date_updated":"2026-02-16T09:55:17Z","PlanS_conform":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1007/s00493-025-00194-8","file_date_updated":"2026-02-16T09:52:38Z","oa_version":"Published Version","_id":"21159","file":[{"content_type":"application/pdf","success":1,"date_created":"2026-02-16T09:52:38Z","relation":"main_file","file_id":"21228","file_size":539646,"file_name":"2026_Combinatorica_Kwan.pdf","creator":"dernst","date_updated":"2026-02-16T09:52:38Z","access_level":"open_access","checksum":"47b0031d90b0e6b9a843f422a1486089"}],"article_number":"5"},{"oa_version":"Preprint","_id":"22159","doi":"10.1007/s00493-023-00034-7","external_id":{"arxiv":["2111.05420"]},"extern":"1","date_updated":"2026-07-08T10:34:40Z","date_published":"2023-08-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T10:51:32Z","publisher":"Springer Nature","type":"journal_article","article_type":"original","issue":"4","year":"2023","intvolume":"        43","abstract":[{"lang":"eng","text":"The size Ramsey number of a graph H is defined as the minimum number of edges in a graph G such that there is a monochromatic copy of H in every two-coloring of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs (obtained by adding many common neighbors to the vertices of a clique), and starburst graphs (obtained by adding many pendant edges to each vertex of a clique). In this paper, we completely resolve the latter two questions and make substantial progress on the first by determining the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s)."}],"OA_place":"repository","publication":"Combinatorica","publication_status":"published","title":"Three early problems on size Ramsey numbers","OA_type":"green","day":"01","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.05420"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Conlon","first_name":"David","full_name":"Conlon, David"},{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson"}],"article_processing_charge":"No","citation":{"ama":"Conlon D, Fox J, Wigderson Y. Three early problems on size Ramsey numbers. <i>Combinatorica</i>. 2023;43(4):743-768. doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Three early problems on size Ramsey numbers. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>","ista":"Conlon D, Fox J, Wigderson Y. 2023. Three early problems on size Ramsey numbers. Combinatorica. 43(4), 743–768.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>.","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorica 43 (2023) 743–768.","mla":"Conlon, David, et al. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>, vol. 43, no. 4, Springer Nature, 2023, pp. 743–68, doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>.","ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Three early problems on size Ramsey numbers,” <i>Combinatorica</i>, vol. 43, no. 4. Springer Nature, pp. 743–768, 2023."},"page":"743-768","oa":1,"arxiv":1,"publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"scopus_import":"1","month":"08","volume":43},{"oa":1,"arxiv":1,"author":[{"last_name":"Conlon","first_name":"David","full_name":"Conlon, David"},{"full_name":"Fox, Jacob","last_name":"Fox","first_name":"Jacob"},{"full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","last_name":"Wigderson"}],"language":[{"iso":"eng"}],"page":"309-363","citation":{"ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Ramsey numbers of books and quasirandomness,” <i>Combinatorica</i>, vol. 42, no. 3. Springer Nature, pp. 309–363, 2022.","mla":"Conlon, David, et al. “Ramsey Numbers of Books and Quasirandomness.” <i>Combinatorica</i>, vol. 42, no. 3, Springer Nature, 2022, pp. 309–63, doi:<a href=\"https://doi.org/10.1007/s00493-021-4409-9\">10.1007/s00493-021-4409-9</a>.","ista":"Conlon D, Fox J, Wigderson Y. 2022. Ramsey numbers of books and quasirandomness. Combinatorica. 42(3), 309–363.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Ramsey Numbers of Books and Quasirandomness.” <i>Combinatorica</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00493-021-4409-9\">https://doi.org/10.1007/s00493-021-4409-9</a>.","ama":"Conlon D, Fox J, Wigderson Y. Ramsey numbers of books and quasirandomness. <i>Combinatorica</i>. 2022;42(3):309-363. doi:<a href=\"https://doi.org/10.1007/s00493-021-4409-9\">10.1007/s00493-021-4409-9</a>","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2022). Ramsey numbers of books and quasirandomness. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-021-4409-9\">https://doi.org/10.1007/s00493-021-4409-9</a>","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorica 42 (2022) 309–363."},"article_processing_charge":"No","volume":42,"scopus_import":"1","month":"06","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"OA_type":"green","publication":"Combinatorica","OA_place":"repository","abstract":[{"text":"The book graph B\r\n(k)\r\nn consists of n copies of Kk+1 joined along a common Kk. The Ramsey\r\nnumbers of B\r\n(k)\r\nn are known to have strong connections to the classical Ramsey numbers\r\nof cliques. Recently, the first author determined the asymptotic order of these Ramsey\r\nnumbers for fixed k, thus answering an old question of Erd˝os, Faudree, Rousseau, and\r\nSchelp. In this paper, we first provide a simpler proof of this theorem. Next, answering a\r\nquestion of the first author, we present a different proof that avoids the use of Szemer´edi’s\r\nregularity lemma, thus providing much tighter control on the error term. Finally, we prove\r\na conjecture of Nikiforov, Rousseau, and Schelp by showing that all extremal colorings for\r\nthis Ramsey problem are quasirandom","lang":"eng"}],"intvolume":"        42","title":"Ramsey numbers of books and quasirandomness","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2001.00407"}],"day":"01","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T10:57:27Z","status":"public","date_published":"2022-06-01T00:00:00Z","issue":"3","year":"2022","type":"journal_article","article_type":"original","publisher":"Springer Nature","doi":"10.1007/s00493-021-4409-9","oa_version":"Preprint","_id":"22174","external_id":{"arxiv":["2001.00407"]},"date_updated":"2026-07-14T08:57:12Z","extern":"1"},{"citation":{"mla":"Fox, Jacob, et al. “Bounded VC-Dimension Implies the Schur-Erdős Conjecture.” <i>Combinatorica</i>, vol. 41, no. 6, Springer Nature, 2021, pp. 803–13, doi:<a href=\"https://doi.org/10.1007/s00493-021-4530-9\">10.1007/s00493-021-4530-9</a>.","ieee":"J. Fox, J. Pach, and A. Suk, “Bounded VC-dimension implies the Schur-Erdős conjecture,” <i>Combinatorica</i>, vol. 41, no. 6. Springer Nature, pp. 803–813, 2021.","short":"J. Fox, J. Pach, A. Suk, Combinatorica 41 (2021) 803–813.","chicago":"Fox, Jacob, János Pach, and Andrew Suk. “Bounded VC-Dimension Implies the Schur-Erdős Conjecture.” <i>Combinatorica</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00493-021-4530-9\">https://doi.org/10.1007/s00493-021-4530-9</a>.","ista":"Fox J, Pach J, Suk A. 2021. Bounded VC-dimension implies the Schur-Erdős conjecture. Combinatorica. 41(6), 803–813.","apa":"Fox, J., Pach, J., &#38; Suk, A. (2021). Bounded VC-dimension implies the Schur-Erdős conjecture. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-021-4530-9\">https://doi.org/10.1007/s00493-021-4530-9</a>","ama":"Fox J, Pach J, Suk A. Bounded VC-dimension implies the Schur-Erdős conjecture. <i>Combinatorica</i>. 2021;41(6):803-813. doi:<a href=\"https://doi.org/10.1007/s00493-021-4530-9\">10.1007/s00493-021-4530-9</a>"},"article_processing_charge":"No","page":"803-813","language":[{"iso":"eng"}],"author":[{"full_name":"Fox, Jacob","last_name":"Fox","first_name":"Jacob"},{"last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"full_name":"Suk, Andrew","last_name":"Suk","first_name":"Andrew"}],"arxiv":1,"oa":1,"publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"month":"11","volume":41,"publication_status":"published","title":"Bounded VC-dimension implies the Schur-Erdős conjecture","abstract":[{"lang":"eng","text":"In 1916, Schur introduced the Ramsey number r(3; m), which is the minimum integer n > 1 such that for any m-coloring of the edges of the complete graph Kn, there is a monochromatic copy of K3. He showed that r(3; m) ≤ O(m!), and a simple construction demonstrates that r(3; m) ≥ 2Ω(m). An old conjecture of Erdős states that r(3; m) = 2Θ(m). In this note, we prove the conjecture for m-colorings with bounded VC-dimension, that is, for m-colorings with the property that the set system induced by the neighborhoods of the vertices with respect to each color class has bounded VC-dimension."}],"intvolume":"        41","publication":"Combinatorica","quality_controlled":"1","day":"20","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1912.02342","open_access":"1"}],"date_published":"2021-11-20T00:00:00Z","status":"public","keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics"],"date_created":"2024-04-03T07:59:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","article_type":"original","type":"journal_article","year":"2021","issue":"6","_id":"15275","oa_version":"Preprint","doi":"10.1007/s00493-021-4530-9","date_updated":"2024-04-09T10:40:08Z","external_id":{"arxiv":["1912.02342"]},"department":[{"_id":"HeEd"}]},{"year":"2020","issue":"2","publisher":"Springer","type":"journal_article","article_type":"original","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-06-22T06:42:26Z","date_published":"2020-04-01T00:00:00Z","status":"public","extern":"1","date_updated":"2023-02-23T14:01:45Z","external_id":{"arxiv":["1810.12144"]},"doi":"10.1007/s00493-019-4086-0","_id":"9582","oa_version":"Preprint","scopus_import":"1","month":"04","volume":40,"publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"arxiv":1,"oa":1,"article_processing_charge":"No","citation":{"mla":"Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” <i>Combinatorica</i>, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:<a href=\"https://doi.org/10.1007/s00493-019-4086-0\">10.1007/s00493-019-4086-0</a>.","ieee":"M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” <i>Combinatorica</i>, vol. 40, no. 2. Springer, pp. 283–305, 2020.","short":"M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.","ama":"Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in triangle-free graphs. <i>Combinatorica</i>. 2020;40(2):283-305. doi:<a href=\"https://doi.org/10.1007/s00493-019-4086-0\">10.1007/s00493-019-4086-0</a>","apa":"Kwan, M. A., Letzter, S., Sudakov, B., &#38; Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/s00493-019-4086-0\">https://doi.org/10.1007/s00493-019-4086-0</a>","ista":"Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.","chicago":"Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” <i>Combinatorica</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/s00493-019-4086-0\">https://doi.org/10.1007/s00493-019-4086-0</a>."},"page":"283-305","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"},{"first_name":"Shoham","last_name":"Letzter","full_name":"Letzter, Shoham"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"},{"last_name":"Tran","first_name":"Tuan","full_name":"Tran, Tuan"}],"main_file_link":[{"url":"https://arxiv.org/abs/1810.12144","open_access":"1"}],"quality_controlled":"1","day":"01","publication_status":"published","title":"Dense induced bipartite subgraphs in triangle-free graphs","abstract":[{"lang":"eng","text":"The problem of finding dense induced bipartite subgraphs in H-free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any H-free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degree at least cH log d/log log d, thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak and Spencer."}],"intvolume":"        40","publication":"Combinatorica"},{"volume":39,"month":"10","scopus_import":"1","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"oa":1,"arxiv":1,"author":[{"last_name":"Fulek","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"M02281","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"page":"1267-1279","isi":1,"citation":{"ieee":"R. Fulek and J. Kynčl, “Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4,” <i>Combinatorica</i>, vol. 39, no. 6. Springer Nature, pp. 1267–1279, 2019.","mla":"Fulek, Radoslav, and Jan Kynčl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.” <i>Combinatorica</i>, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi:<a href=\"https://doi.org/10.1007/s00493-019-3905-7\">10.1007/s00493-019-3905-7</a>.","ama":"Fulek R, Kynčl J. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. <i>Combinatorica</i>. 2019;39(6):1267-1279. doi:<a href=\"https://doi.org/10.1007/s00493-019-3905-7\">10.1007/s00493-019-3905-7</a>","apa":"Fulek, R., &#38; Kynčl, J. (2019). Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-019-3905-7\">https://doi.org/10.1007/s00493-019-3905-7</a>","chicago":"Fulek, Radoslav, and Jan Kynčl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.” <i>Combinatorica</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00493-019-3905-7\">https://doi.org/10.1007/s00493-019-3905-7</a>.","ista":"Fulek R, Kynčl J. 2019. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 39(6), 1267–1279.","short":"R. Fulek, J. Kynčl, Combinatorica 39 (2019) 1267–1279."},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.00508"}],"day":"29","quality_controlled":"1","ec_funded":1,"publication":"Combinatorica","abstract":[{"text":"We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of independent edges crossing an even number of times. This shows that the strong Hanani–Tutte theorem cannot be extended to the orientable surface of genus 4. As a base step in the construction we use a counterexample to an extension of the unified Hanani–Tutte theorem on the torus.","lang":"eng"}],"intvolume":"        39","publication_status":"published","title":"Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4","issue":"6","year":"2019","article_type":"original","type":"journal_article","publisher":"Springer Nature","date_created":"2019-11-18T14:29:50Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","date_published":"2019-10-29T00:00:00Z","department":[{"_id":"UlWa"}],"external_id":{"isi":["000493267200003"],"arxiv":["1709.00508"]},"date_updated":"2025-04-14T13:52:37Z","doi":"10.1007/s00493-019-3905-7","oa_version":"Preprint","_id":"7034"},{"oa_version":"None","_id":"4069","doi":"10.1007/BF02122779","date_updated":"2022-02-21T11:08:30Z","extern":"1","status":"public","date_published":"1990-09-01T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:06:45Z","type":"journal_article","article_type":"original","publisher":"Springer","issue":"3","year":"1990","publication":"Combinatorica","abstract":[{"lang":"eng","text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry."}],"intvolume":"        10","publication_status":"published","title":"An acyclicity theorem for cell complexes in d dimension","day":"01","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02122779"}],"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"language":[{"iso":"eng"}],"page":"251 - 260","citation":{"ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” <i>Combinatorica</i>, vol. 10, no. 3. Springer, pp. 251–260, 1990.","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>.","apa":"Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. 1990;10(3):251-260. doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>","ista":"Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>.","short":"H. Edelsbrunner, Combinatorica 10 (1990) 251–260."},"article_processing_charge":"No","publist_id":"2050","acknowledgement":"Research reported in this paper was supported by the National Science Foundation under grant CCR-8714565.","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"volume":10,"scopus_import":"1","month":"09"}]