{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:43Z","timestamp":1740122383066,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901605","12101069"],"award-info":[{"award-number":["11901605","12101069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901292"],"award-info":[{"award-number":["11901292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00893-8","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:03:36Z","timestamp":1661198616000},"page":"3310-3330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number"],"prefix":"10.1007","volume":"44","author":[{"given":"Zhongzheng","family":"Tang","sequence":"first","affiliation":[]},{"given":"Yucong","family":"Tang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-5960","authenticated-orcid":false,"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"3","key":"893_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/jgt.22533","volume":"94","author":"R Aharoni","year":"2019","unstructured":"Aharoni R, Zerbib S (2019) A generalization of tuza\u2019s conjecture. J Graph Theory 94(3):445\u2013462","journal-title":"J Graph Theory"},{"unstructured":"Baron JD (2016) Two problems on cycles in random graphs. Ph.D. thesis, Rutgers University-Graduate School-New Brunswick","key":"893_CR2"},{"issue":"5","key":"893_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1017\/S0963548316000067","volume":"25","author":"JD Baron","year":"2016","unstructured":"Baron JD, Kahn J (2016) Tuza\u2019s conjecture is asymptotically tight for dense graphs. Comb Probab Comput 25(5):645\u2013667","journal-title":"Comb Probab Comput"},{"unstructured":"Bennett P, Dudek A, Zerbib S (2018) Large triangle packings and tuza\u2019s conjecture in sparse random graphs. arXiv preprint arXiv:1810.11739","key":"893_CR4"},{"key":"893_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.entcs.2019.08.016","volume":"346","author":"F Botler","year":"2019","unstructured":"Botler F, Fernandes C, Guti\u00e9rrez J (2019) On tuza\u2019s conjecture for triangulations and graphs with small treewidth. Electronic Notes in Theoretical Computer Science 346:171\u2013183","journal-title":"Electronic Notes in Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Botler F, Fernandes CG, Guti\u00e9rrez J (2018) On tuza\u2019s conjecture for graphs with treewidth at most 6. In: Anais do III Encontro de Teoria da Computa\u00e7\u00e3o. SBC","key":"893_CR6","DOI":"10.5753\/etc.2018.3141"},{"doi-asserted-by":"crossref","unstructured":"Chalermsook P, Khuller S, Sukprasert P, Uniyal S (2020) Multi-transversals for triangles and the tuza\u2019s conjecture. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1955\u20131974. SIAM","key":"893_CR7","DOI":"10.1137\/1.9781611975994.121"},{"doi-asserted-by":"crossref","unstructured":"Chen X, Diao Z, Hu X, Tang Z (2016) Sufficient conditions for Tuza\u2019s conjecture on packing and covering triangles. In: International Workshop on Combinatorial Algorithms, pp. 266\u2013277. Springer","key":"893_CR8","DOI":"10.1007\/978-3-319-44543-4_21"},{"issue":"6","key":"893_CR9","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 (2018) Covering Triangles in Edge-Weighted Graphs. Theory of Computing Systems 62(6):1525\u20131552","journal-title":"Theory of Computing Systems"},{"issue":"6","key":"893_CR10","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s00373-010-0881-5","volume":"25","author":"Q Cui","year":"2009","unstructured":"Cui Q, Haxell P, Ma W (2009) Packing and covering triangles in planar graphs. Graphs and Combinatorics 25(6):817\u2013824","journal-title":"Graphs and Combinatorics"},{"issue":"1\u20133","key":"893_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(95)00178-Y","volume":"150","author":"P Erd\u00f6s","year":"1996","unstructured":"Erd\u00f6s P, Gallai T, Tuza Z (1996) Covering and independence in triangle structures. Discret Math 150(1\u20133):89\u2013101","journal-title":"Discret Math"},{"issue":"1","key":"893_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z F\u00fcredi","year":"1988","unstructured":"F\u00fcredi Z (1988) Matchings and covers in hypergraphs. Graphs and Combinatorics 4(1):115\u2013206","journal-title":"Graphs and Combinatorics"},{"issue":"9","key":"893_CR13","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/j.dam.2010.05.027","volume":"161","author":"SK Ghosh","year":"2013","unstructured":"Ghosh SK, Haxell PE (2013) Packing and covering tetrahedra. Discret Appl Math 161(9):1209\u20131215","journal-title":"Discret Appl Math"},{"issue":"5","key":"893_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00373-011-1071-9","volume":"28","author":"P Haxell","year":"2012","unstructured":"Haxell P, Kostochka A, Thomass\u00e9 S (2012) Packing and covering triangles in $$K_4$$-free planar graphs. Graphs and Combinatorics 28(5):653\u2013662","journal-title":"Graphs and Combinatorics"},{"issue":"5","key":"893_CR15","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejc.2011.09.024","volume":"33","author":"P Haxell","year":"2012","unstructured":"Haxell P, Kostochka A, Thomass\u00e9 S (2012) A stability theorem on fractional covering of triangles by edges. Eur J Comb 33(5):799\u2013806","journal-title":"Eur J Comb"},{"issue":"1","key":"893_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","volume":"195","author":"PE Haxell","year":"1999","unstructured":"Haxell PE (1999) Packing and covering triangles in graphs. Discret Math 195(1):251\u2013254","journal-title":"Discret Math"},{"issue":"1","key":"893_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s003730050010","volume":"14","author":"PE Haxell","year":"1998","unstructured":"Haxell PE, Kohayakawa Y (1998) Packing and covering triangles in tripartite graphs. Graphs and Combinatorics 14(1):1\u201310","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"893_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s004930170003","volume":"21","author":"PE Haxell","year":"2001","unstructured":"Haxell PE, R\u00f6dl V (2001) Integer and fractional packings in dense graphs. Combinatorica 21(1):13\u201338","journal-title":"Combinatorica"},{"unstructured":"Hosseinzadeh H, Soltankhah N (2015) Relations between some packing and covering parameters of graphs. In: The 46 th Annual Iranian Mathematics Conference, p. 715","key":"893_CR19"},{"issue":"1","key":"893_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(93)00228-W","volume":"142","author":"M Krivelevich","year":"1995","unstructured":"Krivelevich M (1995) On a conjecture of Tuza about packing and covering of triangles. Discret Math 142(1):281\u2013286","journal-title":"Discret Math"},{"issue":"3","key":"893_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S0963548397003106","volume":"6","author":"M Krivelevich","year":"1997","unstructured":"Krivelevich M (1997) Triangle factors in random graphs. Comb Probab Comput 6(3):337\u2013347","journal-title":"Comb Probab Comput"},{"key":"893_CR22","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.dam.2015.12.012","volume":"209","author":"A Lakshmanan","year":"2016","unstructured":"Lakshmanan A, Bujt\u00e1s C, Tuza Z (2016) Induced cycles in triangle graphs. Discret Appl Math 209:264\u2013275","journal-title":"Discret Appl Math"},{"unstructured":"Munaro A (2016) On some classical and new hypergraph invariants. Ph.D. thesis","key":"893_CR23"},{"issue":"4","key":"893_CR24","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00373-018-1903-y","volume":"34","author":"A Munaro","year":"2018","unstructured":"Munaro A (2018) Triangle packings and transversals of some $$K_4$$-free graphs. Graphs and Combinatorics 34(4):647\u2013668","journal-title":"Graphs and Combinatorics"},{"key":"893_CR25","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ejc.2015.03.006","volume":"49","author":"GJ Puleo","year":"2015","unstructured":"Puleo GJ (2015) Tuza\u2019s conjecture for graphs with maximum average degree less than 7. Eur J Comb 49:134\u2013152","journal-title":"Eur J Comb"},{"issue":"7","key":"893_CR26","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1016\/j.disc.2017.02.020","volume":"340","author":"GJ Puleo","year":"2017","unstructured":"Puleo GJ (2017) Maximal k-edge-colorable subgraphs, vizing\u2019s theorem, and tuza\u2019s conjecture. Discret Math 340(7):1573\u20131580","journal-title":"Discret Math"},{"issue":"1\u20133","key":"893_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0012-365X(92)90141-2","volume":"105","author":"A Ruci\u0144ski","year":"1992","unstructured":"Ruci\u0144ski A (1992) Matching and covering the vertices of a random graph by copies of a given graph. Discret Math 105(1\u20133):185\u2013197","journal-title":"Discret Math"},{"doi-asserted-by":"crossref","unstructured":"Tang Z, Tang Y, Diao Z (2021) On the feedback number of 3-uniform linear extremal hypergraphs. In: D.\u00a0Du, D.\u00a0Du, C.\u00a0Wu, D.\u00a0Xu (eds.) Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings, Lecture Notes in Computer Science, vol. 13135, pp. 687\u2013700. Springer","key":"893_CR28","DOI":"10.1007\/978-3-030-92681-6_54"},{"issue":"4","key":"893_CR29","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF01787705","volume":"6","author":"Z Tuza","year":"1990","unstructured":"Tuza Z (1990) A conjecture on triangles of graphs. Graphs and Combinatorics 6(4):373\u2013380","journal-title":"Graphs and Combinatorics"},{"issue":"2","key":"893_CR30","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/moor.10.2.280","volume":"10","author":"M Yannakakis","year":"1985","unstructured":"Yannakakis M (1985) On a class of totally unimodular matrices. Math Oper Res 10(2):280\u2013304","journal-title":"Math Oper Res"},{"issue":"6","key":"893_CR31","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1017\/S0963548312000235","volume":"21","author":"R Yuster","year":"2012","unstructured":"Yuster R (2012) Dense graphs with a large triangle cover have a large triangle packing. Comb Probab Comput 21(6):952\u2013962","journal-title":"Comb Probab Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00893-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00893-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00893-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:39:09Z","timestamp":1667036349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00893-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["893"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00893-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"27 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}