{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:47Z","timestamp":1740122387195,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-022-00864-z","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T09:05:25Z","timestamp":1652346325000},"page":"894-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding a minimal spanning hypertree of a weighted hypergraph"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2759-4606","authenticated-orcid":false,"given":"G. H.","family":"Shirdel","sequence":"first","affiliation":[]},{"given":"B.","family":"Vaez-Zadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"issue":"2","key":"864_CR1","first-page":"5","volume":"2","author":"MA Bahmanian","year":"2015","unstructured":"Bahmanian MA, Sajna M (2015) Connection and separation in hypergraphs. Theory Appl Graph 2(2):5","journal-title":"Theory Appl Graph"},{"key":"864_CR2","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications, vol 290, London, Macmillan","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"1","key":"864_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1090\/S0894-0347-09-00645-6","volume":"23","author":"D Conlon","year":"2010","unstructured":"Conlon D, Fox J, Sudakov B (2010) Hypergraph ramsey numbers. J Am Math Soc 23(1):247\u2013266","journal-title":"J Am Math Soc"},{"issue":"2","key":"864_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.4153\/CMB-2018-005-9","volume":"61","author":"M Dewar","year":"2018","unstructured":"Dewar M, Pike D, Proos J (2018) Connectivity in hypergraphs. Canadian Math Bull 61(2):252\u2013271","journal-title":"Canadian Math Bull"},{"issue":"2\u20133","key":"864_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF02579216","volume":"4","author":"Z F\u00fcredi","year":"1984","unstructured":"F\u00fcredi Z (1984) Hypergraphs in which all disjoint pairs have distinct unions. Combinatorica 4(2\u20133):161\u2013168","journal-title":"Combinatorica"},{"issue":"6","key":"864_CR6","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TNET.2014.2343914","volume":"23","author":"J Gao","year":"2014","unstructured":"Gao J, Zhao Q, Ren W, Swami A, Ramanathan R, Bar-Noy A (2014) Dynamic shortest path algorithms for hypergraphs. IEEE\/ACM Trans Networking 23(6):1805\u20131817","journal-title":"IEEE\/ACM Trans Networking"},{"key":"864_CR7","unstructured":"Graham RL, Rothschild BL, Spencer JH (1990) Ramsey theory, vol 20, Wiley"},{"key":"864_CR8","first-page":"83","volume":"392","author":"P Keevash","year":"2011","unstructured":"Keevash P (2011) Hypergraph Turan problems. Surv Comb 392:83\u2013140","journal-title":"Surv Comb"},{"key":"864_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jctb.2016.03.001","volume":"119","author":"J Kim","year":"2016","unstructured":"Kim J (2016) Regular subgraphs of uniform hypergraphs. J Comb Theory Ser B 119:214\u2013236","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"864_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.7151\/dmgt.1722","volume":"34","author":"J Kim","year":"2014","unstructured":"Kim J, Kostochka AV (2014) Maximum hypergraphs without regu- lar subgraphs. Discuss Math Graph Theory 34(1):151\u2013166","journal-title":"Discuss Math Graph Theory"},{"issue":"7","key":"864_CR11","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/j.jcta.2005.12.007","volume":"113","author":"AV Kostochka","year":"2006","unstructured":"Kostochka AV, R\u00f6dl V (2006) On Ramsey numbers of uniform hy- pergraphs with given maximum degree. J Comb Theory Ser A 113(7):1555\u20131564","journal-title":"J Comb Theory Ser A"},{"issue":"2","key":"864_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jcta.2004.02.002","volume":"106","author":"D Mubayi","year":"2004","unstructured":"Mubayi D, Verstra\u00ebte J (2004) A hypergraph extension of the bipar- tite Tur\u00e1n problem. J Comb Theory Ser A 106(2):237\u2013253","journal-title":"J Comb Theory Ser A"},{"issue":"3","key":"864_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.jctb.2008.10.005","volume":"99","author":"D Mubayi","year":"2009","unstructured":"Mubayi D, Verstra\u00ebte J (2009) Two-regular subgraphs of hypergraphs. J Comb Theory Ser B 99(3):643\u2013655","journal-title":"J Comb Theory Ser B"},{"issue":"3","key":"864_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.jcta.2008.09.002","volume":"116","author":"O Pikhurko","year":"2009","unstructured":"Pikhurko O, Verstra\u00ebte J (2009) The maximum size of hypergraphs without generalized 4-cycles. J. Comb. Theory Ser. A 116(3):637\u2013649","journal-title":"J. Comb. Theory Ser. A"},{"key":"864_CR15","unstructured":"Shirdel GH, Vaez-Zadeh B (2019) The weak hyperedge tenacity of the hypercycles. Appl Appl Math 14(2)"},{"key":"864_CR16","unstructured":"Voloshin VI (2009) Introduction to graph and hypergraph theory. Nova Science Publ"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00864-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00864-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00864-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:33:46Z","timestamp":1659080026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00864-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["864"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00864-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,5,12]]},"assertion":[{"value":"2 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}