{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:15:12Z","timestamp":1742922912903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_12","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"162-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Transversal Number of\u00a0Rank k Hypergraphs"],"prefix":"10.1007","author":[{"given":"Zhongzheng","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"12_CR1","volume-title":"Hypergraphs","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. North-Holland, Paris (1989)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105\u2013118. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19488-6_110"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s00224-018-9860-7","volume":"62","author":"X Chen","year":"2018","unstructured":"Chen, X., Diao, Z., Hu, X., Tang, Z.: Covering triangles in edge-weighted graphs. Theory Comput. Syst. 62(6), 1525\u20131552 (2018)","journal-title":"Theory Comput. Syst."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Mcdiarmid, C.: Small transversals in hypergraphs. Combinatorica 12(1), 19\u201326 (1992)","DOI":"10.1007\/BF01191201"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s40305-019-00284-7","volume":"9","author":"Z Diao","year":"2021","unstructured":"Diao, Z.: On the vertex cover number of 3-uniform hypergraphs. J. Oper. Res. Soc. China 9, 427\u2013440 (2021)","journal-title":"J. Oper. Res. Soc. China"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th Edition, Graduate texts in mathematics, vol. 173. Springer, New York (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"12_CR8","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. Comb. 36, 231\u2013236 (2014)","journal-title":"Eur. J. Comb."},{"key":"12_CR9","first-page":"133","volume":"2","author":"T Gallai","year":"1959","unstructured":"Gallai, T.: Uber extreme punkt-und kantenmengen, annales universitatis scientiarum budapestinensis de rolando eotvos nominatae. Sect. Math. 2, 133\u2013138 (1959)","journal-title":"Sect. Math."},{"issue":"3","key":"12_CR10","first-page":"1133","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. Discrete Appl. Math. 10(3), 1133\u20131140 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/jgt.20345","volume":"60","author":"MA Henning","year":"2010","unstructured":"Henning, M.A., Yeo, A.: Total domination in $$2$$-connected graphs and in graphs with no induced $$6$$-cycles. J. Graph Theory 60(1), 55\u201379 (2010)","journal-title":"J. Graph Theory"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Yeo, A.: Hypergraphs with large transversal number. Discrete Math. 313, 959\u2013966 (2013)","DOI":"10.1016\/j.disc.2013.01.012"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1002\/jgt.21640","volume":"72","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three. J. Graph Theory 72, 220\u2013245 (2013)","journal-title":"J. Graph Theory"},{"key":"12_CR14","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. Euro. J. Combinatorics 34, 217\u2013228 (2013)","journal-title":"Euro. J. Combinatorics"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0095-8956(90)90101-5","volume":"50","author":"FC Lai","year":"1990","unstructured":"Lai, F.C., Chang, G.J.: An upper bound for the transversal numbers of $$4$$-uniform hypergraphs. J. Combinatorial Theory Ser. B 50(1), 129\u2013133 (1990)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"12_CR16","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00493-007-2020-3","volume":"27","author":"S Thomass\u00e9","year":"2007","unstructured":"Thomass\u00e9, S., Yeo, A.: Total domination of graphs and small transversals of hypergraphs. Combinatorica 27(4), 473\u2013487 (2007)","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"12_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","volume":"86","author":"Z Tuza","year":"1990","unstructured":"Tuza, Z.: Covering all cliques of a graph. Discret. Math. 86(1\u20133), 117\u2013126 (1990)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:48:41Z","timestamp":1672552121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}