國立清華大學 數學系

Tea time：15:00, Room 707
Abstract:
Bijective proofs are widely used in combinatorial counting problems. In this talk, I will show some results of using bijective proofs to count phylogenetic networks (tree-child networks and ranked tree-child networks).
The talk is based on joint work with Alessandra Caraceni (Scuola Normale Superiore), Michael Fuchs (National Chengchi University) and Louxin Zhang (National Singapore University).