Abstract

In this talk, we focus on hypergraph transversals, a fundamental concept that appears in many areas of computer science. We discuss extremal questions concerning the transversal number of uniform hypergraphs, in particular the Tuza constants   , where  denotes the transversal number of a k-uniform hypergraph H. We highlight connections with applications, such as coding theory, and discuss some elegant ideas arising in the study of this problem.

Bio.

Dr. Hung-Lung Wang is a Professor in the Department of Computer Science and Information Engineering at National Taiwan Normal University. He received his Ph.D. in Computer Science in 2008 from National Taiwan University. He subsequently served as a postdoctoral fellow at the Research Center for Information Technology Innovation, Academia Sinica, and held a faculty position at National Taipei University of Business from 2010 to 2018. His research interests include algorithm design and discrete mathematics.

All faculty and students are welcome to join.