{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T23:40:12Z","timestamp":1720395612084},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1921-9","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T05:41:50Z","timestamp":1530769310000},"page":"931-945","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four"],"prefix":"10.1007","volume":"34","author":[{"given":"Shan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanxia","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,5]]},"reference":[{"key":"1921_CR1","first-page":"117","volume":"4","author":"BD Acharya","year":"2007","unstructured":"Acharya, B.D.: Domination in hypergraphs. AKCE J. Combin. 4, 117\u2013126 (2007)","journal-title":"AKCE J. Combin."},{"key":"1921_CR2","unstructured":"Acharya, B.D.: Domination in hypergraphs II. New directions. In: Proceedings of International Conference on ICDM, Mysore, pp. 1\u201316 (2008)"},{"key":"1921_CR3","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 tri-partite 3-graphs. Combinatorica 21, 1\u20134 (2001)","journal-title":"Combinatorica"},{"key":"1921_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ejc.2015.05.005","volume":"51","author":"R Aharoni","year":"2016","unstructured":"Aharoni, R., Argue, C.J.: Covers in partitioned intersecting hypergraphs. Eur. J. Combin. 51, 222\u2013226 (2016)","journal-title":"Eur. J. Combin."},{"key":"1921_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N Alon","year":"1990","unstructured":"Alon, N.: Transversal numbers of uniform hypergraphs. Graphs Combin. 6, 1\u20134 (1990)","journal-title":"Graphs Combin."},{"key":"1921_CR6","unstructured":"Arumugam, S., Jose, B., Bujt\u00e1s, C., Tuza, Zs.: Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161, 1859\u20131867 (2013)"},{"key":"1921_CR7","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs., Henning, M.A., Tuza, Zs.: Transversals and domination in uniform hypergraphs. Eur. J. Combin. 33, 62\u201371 (2012)","DOI":"10.1016\/j.ejc.2011.08.002"},{"key":"1921_CR8","volume-title":"A Geometrical Picture Book","author":"P Burkard","year":"1998","unstructured":"Burkard, P.: A Geometrical Picture Book. Springer, New York (1998)"},{"key":"1921_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01191201","volume":"12","author":"V Chv\u00e1tal","year":"1992","unstructured":"Chv\u00e1tal, V., McDiarmid, C.: Small transversals in hypergraphs. Combinatorica 12, 19\u201326 (1992)","journal-title":"Combinatorica"},{"key":"1921_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0095-8956(79)90044-3","volume":"27","author":"EJ Cockayne","year":"1979","unstructured":"Cockayne, E.J., Hedetniemi, S.T., Slater, P.J.: Matchings and transversals in hypergraphs, domination and independence-in trees. J. Combin. Theory Ser. B 27, 78\u201380 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1921_CR11","doi-asserted-by":"crossref","first-page":"#P1.80","DOI":"10.37236\/4784","volume":"22","author":"S Das","year":"2015","unstructured":"Das, S., Sudakov, B.: Most probably intersecting hypergraphs. Electron. J. Combin. 22(1), #P1.80 (2015)","journal-title":"Electron. J. Combin."},{"key":"1921_CR12","doi-asserted-by":"publisher","unstructured":"Dong, Y., Shan, E., Kang, L., Li, S.: Domination in intersecting hypergraphs. Discrete Appl. Math. (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.05.039","DOI":"10.1016\/j.dam.2018.05.039"},{"key":"1921_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ejc.2013.07.016","volume":"36","author":"M Dorfling","year":"2014","unstructured":"Dorfling, M., Henning, M.A.: Linear hypergraphs with large transversal number and maximum degree two. Eur. J. Combin. 36, 231\u2013236 (2014)","journal-title":"Eur. J. Combin."},{"issue":"2","key":"1921_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxf. 12(2), 313\u2013320 (1961)","journal-title":"Q. J. Math. Oxf."},{"key":"1921_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF02579260","volume":"6","author":"P Frankl","year":"1986","unstructured":"Frankl, P., F\u00fcredi, Z.: Finite projective spaces and intersecting hypergraphs. Combinatorica 6, 335\u2013354 (1986)","journal-title":"Combinatorica"},{"key":"1921_CR16","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 Combin. 4, 115\u2013206 (1988)","journal-title":"Graphs Combin."},{"key":"1921_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(97)00136-2","volume":"182","author":"B Guiduli","year":"1998","unstructured":"Guiduli, B., Kirfily, Z.: On intersecting hypergraphs. Discret. Math. 182, 139\u2013151 (1998)","journal-title":"Discret. Math."},{"key":"1921_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01876928","volume":"30","author":"P Haxell","year":"1995","unstructured":"Haxell, P.: A note on a conjecture of Ryser. Period Math. Hungar. 30, 73\u201379 (1995)","journal-title":"Period Math. Hungar."},{"key":"1921_CR19","doi-asserted-by":"crossref","first-page":"#P23","DOI":"10.37236\/1175","volume":"19","author":"P Haxell","year":"2012","unstructured":"Haxell, P., Scott, A.: On Ryser\u2019s conjecture. Electron. J. Combin. 19, #P23 (2012)","journal-title":"Electron. J. Combin."},{"key":"1921_CR20","volume-title":"Fundamentals of Domination in Graphs","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"1921_CR21","volume-title":"Domination in Graphs: Advanced Topics","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"1921_CR22","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1016\/j.dam.2012.03.023","volume":"160","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., L\u00f6wenstein, C.: Hypergraphs with large domination number and edge sizes at least 3. Discret. Appl. Math. 160, 1757\u20131765 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1921_CR23","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.2478\/s11533-012-0023-9","volume":"10","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., L\u00f6wenstein, C.: Hypergraphs with large transversal number and with edge sizes at least four. Cent. Eur. J. Math. 10(3), 1133\u20131140 (2012)","journal-title":"Cent. Eur. J. Math."},{"key":"1921_CR24","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1002\/jgt.20340","volume":"59","author":"MA Henning","year":"2008","unstructured":"Henning, M.A., Yeo, A.: Hypergraphs with large transversal number and with edge sizes at least three. J. Graph Theory 59, 326\u2013348 (2008)","journal-title":"J. Graph Theory"},{"key":"1921_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ejc.2012.07.001","volume":"34","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Transversals and matchings in 3-uniform hypergraphs. Eur. J. Combin. 34, 217\u2013228 (2013)","journal-title":"Eur. J. Combin."},{"key":"1921_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013)"},{"key":"1921_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2989\/16073606.2013.779991","volume":"37","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Yeo, A.: Matching critical intersecting hypergraphs. Quest. Math. 37, 127\u2013138 (2014)","journal-title":"Quest. Math."},{"issue":"2","key":"1921_CR28","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","volume":"18","author":"AJW Hilton","year":"1967","unstructured":"Hilton, A.J.W., Milner, E.C.: Some intersection theorems for systems of finite sets. Q. J. Math. Oxf. 18(2), 369\u2013384 (1967)","journal-title":"Q. J. Math. Oxf."},{"key":"1921_CR29","unstructured":"Jose, B.K., Tuza, Zs.: Hypergraph domination and strong independence. Appl. Anal. Discret. Math. 3, 237\u2013358 (2009)"},{"issue":"2","key":"1921_CR30","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/s10878-016-0098-5","volume":"34","author":"L Kang","year":"2017","unstructured":"Kang, L., Li, S., Dong, Y., Shan, E.: Matching and domination numbers in $$r$$ r -uniform hypergraphs. J. Combin. Optim. 34(2), 656\u2013659 (2017)","journal-title":"J. Combin. Optim."},{"key":"1921_CR31","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00373-010-0917-x","volume":"26","author":"M Kano","year":"2010","unstructured":"Kano, M., Wu, Y., Yu, Q.: Star-uniform graphs. Graphs Combin. 26, 383\u2013394 (2010)","journal-title":"Graphs Combin."},{"key":"1921_CR32","unstructured":"K\u00f6nig, D.: Theorie der endilichen und unendilichen Graphen, Leipzig (1936) (Reprinted Clelsea and New York, 1950)"},{"key":"1921_CR33","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/00029890.1991.12000759","volume":"98","author":"CWH Lam","year":"1991","unstructured":"Lam, C.W.H.: The search for a finite projective plane of order 10. Am. Math. Mon. 98, 305\u2013318 (1991)","journal-title":"Am. Math. Mon."},{"key":"1921_CR34","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00373-008-0821-9","volume":"25","author":"T Mansour","year":"2009","unstructured":"Mansour, T., Song, C., Yuster, R.: A comment on Ryser\u2019s conjecture for intersecting hypergraphs. Graphs Combin. 25, 101\u2013109 (2009)","journal-title":"Graphs Combin."},{"key":"1921_CR35","first-page":"65","volume":"55","author":"B Randerath","year":"1999","unstructured":"Randerath, B., Volkmann, L.: Characterization of graphs with equal domination and matching number. Util. Math. 55, 65\u201372 (1999)","journal-title":"Util. Math."},{"key":"1921_CR36","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.dam.2017.10.019","volume":"236","author":"E Shan","year":"2018","unstructured":"Shan, E., Dong, Y., Kang, L., Li, S.: Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236, 415\u2013421 (2018)","journal-title":"Discret. Appl. Math."},{"key":"1921_CR37","unstructured":"Tuza, Zs.: Ryser\u2019s conjecture on transversal of $$r$$ r -partite hypergraphs. Ars Combin. 16(B), 201\u2013209 (1983)"},{"key":"1921_CR38","unstructured":"Tuza, Zs.: On the order of vertex sets meeting all edges of a 3-partite hypergraph. Ars Combin. 24(A), 59\u201363 (1987)"},{"key":"1921_CR39","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0002-9947-1907-1500792-1","volume":"8","author":"O Veblen","year":"1907","unstructured":"Veblen, O., Wedderburn, J.H.M.: Non-Desarguesian and non-Pascalian geometries. Trans. Am. Math. Soc. 8, 379\u2013388 (1907)","journal-title":"Trans. Am. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1921-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1921-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1921-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T23:18:48Z","timestamp":1720394328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1921-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,5]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1921"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1921-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,5]]},"assertion":[{"value":"6 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}