An Upper Bound for the Transversal Number of Connected k-Uniform Hypergraphs
Crossref DOI link: https://doi.org/10.1007/s40305-022-00445-1
Published Online: 2022-10-26
Published Print: 2024-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chen, Zi-An
Chen, Bin
Text and Data Mining valid from 2022-10-26
Version of Record valid from 2022-10-26
Article History
Received: 15 April 2022
Revised: 3 September 2022
Accepted: 7 September 2022
First Online: 26 October 2022
Conflict of interest
: No potential conflict of interest was reported by the authors.