{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T10:17:29Z","timestamp":1783592249290,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T00:00:00Z","timestamp":1783555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T00:00:00Z","timestamp":1783555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00493-026-00220-3","type":"journal-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T09:24:09Z","timestamp":1783589049000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Counterexample to a Conjecture of Lov\u00e1sz"],"prefix":"10.1007","volume":"46","author":[{"given":"Alexander","family":"Clow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Penny","family":"Haxell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,9]]},"reference":[{"issue":"1","key":"220_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004930170001","volume":"21","author":"R Aharoni","year":"2001","unstructured":"Aharoni, R.: Ryser\u2019s conjecture for tripartite 3-graphs. Combinatorica 21(1), 1\u20134 (2001)","journal-title":"Combinatorica"},{"issue":"2","key":"220_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. Journal of Graph Theory 35(2), 83\u201388 (2000)","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"220_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.4153\/CJM-1973-040-1","volume":"25","author":"N Biggs","year":"1973","unstructured":"Biggs, N.: Three remarkable graphs. Can. J. Math. 25(2), 397\u2013411 (1973)","journal-title":"Can. J. Math."},{"key":"220_CR4","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)","edition":"2"},{"issue":"2","key":"220_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1112\/blms\/3.2.155","volume":"3","author":"N Biggs","year":"1971","unstructured":"Biggs, N., Smith, D.: On trivalent graphs. Bull. Lond. Math. Soc. 3(2), 155\u2013158 (1971)","journal-title":"Bull. Lond. Math. Soc."},{"key":"220_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105366","volume":"179","author":"A Bishnoi","year":"2021","unstructured":"Bishnoi, A., Das, S., Morris, P., Szab\u00f3, T.: Ryser\u2019s conjecture for t-intersecting hypergraphs. Journal of Combinatorial Theory, Series A 179, 105366 (2021)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"220_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)"},{"issue":"1","key":"220_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.disc.2017.08.038","volume":"341","author":"S Bustamante","year":"2018","unstructured":"Bustamante, S., Stein, M.: Monochromatic tree covers and Ramsey numbers for set-coloured graphs. Discret. Math. 341(1), 266\u2013276 (2018)","journal-title":"Discret. Math."},{"key":"220_CR9","first-page":"41","volume":"40","author":"M Conder","year":"2002","unstructured":"Conder, M., Dobcs\u00e1nyi, P.: Trivalent symmetric graphs on up to 768 vertices. J. Comb. Math. Comb. Comput. 40, 41\u201364 (2002)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"220_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10801-006-7397-3","volume":"23","author":"M Conder","year":"2006","unstructured":"Conder, M., Malni\u010d, A., Maru\u0161i\u010d, D., Poto\u010dnik, P.: A census of semisymmetric cubic graphs on up to 768 vertices. J. Algebraic Combin. 23, 255\u2013294 (2006)","journal-title":"J. Algebraic Combin."},{"key":"220_CR11","doi-asserted-by":"crossref","unstructured":"Conder, M., Poto\u010dnik, P.: Edge-transitive cubic graphs: Cataloguing and enumeration. arXiv:2502.02250, (2025)","DOI":"10.1016\/j.jalgebra.2025.07.035"},{"key":"220_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejc.2016.10.004","volume":"61","author":"N Franceti\u0107","year":"2017","unstructured":"Franceti\u0107, N., Herke, S., McKay, B.D., Wanless, I.M.: On Ryser\u2019s conjecture for linear intersecting multipartite hypergraphs. Eur. J. Comb. 61, 91\u2013105 (2017)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"220_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02579271","volume":"1","author":"Z F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1(2), 155\u2013162 (1981)","journal-title":"Combinatorica"},{"issue":"1","key":"220_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z F\u00fcredi","year":"1988","unstructured":"F\u00fcredi, Z.: Matchings and covers in hypergraphs. Graphs and Combinatorics 4(1), 115\u2013206 (1988)","journal-title":"Graphs and Combinatorics"},{"key":"220_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.jcta.2018.04.004","volume":"158","author":"P Haxell","year":"2018","unstructured":"Haxell, P., Narins, L., Szab\u00f3, T.: Extremal hypergraphs for Ryser\u2019s conjecture. Journal of Combinatorial Theory, Series A 158, 492\u2013547 (2018)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Haxell, P., Scott, A.: On Ryser\u2019s conjecture. Electron. J. Combin. pages P23.1\u2013P23.10(2012)","DOI":"10.37236\/1175"},{"key":"220_CR17","unstructured":"J.R., H.: Permutation decomposition of (0, 1)-matrices and decomposition transversals, California Institute of Technology (1971). (PhD thesis)"},{"key":"220_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Minimax theorems for hypergraphs. In Hypergraph Seminar, pages 111\u2013126. Springer, (1974)","DOI":"10.1007\/BFb0066186"},{"issue":"3\u20134","key":"220_CR19","first-page":"209","volume":"26","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On minimax theorems of combinatorics (Doctoral thesis, in Hungarian). Math. Lapok 26(3\u20134), 209\u2013264 (1975)","journal-title":"Math. Lapok"},{"key":"220_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"220_CR21","unstructured":"Tuza, Z.: Some special cases of Ryser\u2019s conjecture. Unpublished manuscript, (1979)"},{"key":"220_CR22","first-page":"201","volume":"16","author":"Z Tuza","year":"1983","unstructured":"Tuza, Z.: Ryser\u2019s conjecture on transversals of r-partite hypergraphs. Ars Combin. 16, 201\u2013209 (1983)","journal-title":"Ars Combin."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00220-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-026-00220-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00220-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T09:24:10Z","timestamp":1783589050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-026-00220-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s00493-026-00220-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,9]]},"assertion":[{"value":"10 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"26"}}