activity
20162020
collaborators

10 papers

math.CO2020

Asymptotic Enumeration and Distributional Properties of Galled Networks

Michael Fuchs, Guan-Ru Yu, Louxin Zhang

We show a first-order asymptotics result for the number of galled networks with leaves. This is the first class of phylogenetic networks of {\it large} size for which an asympt…

math.CO2020

Expected number of pattern and submap occurrences in random planar maps

Guan-Ru Yu

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper…

math.CO2020

Universal singular exponents in catalytic variable equations

Michael Drmota, Marc Noy, Guan-Ru Yu

Catalytic equations appear in several combinatorial applications, most notably in the numeration of lattice path and in the enumeration of planar maps. The main purpose of this pap…

math.CO2020

On the Asymptotic Growth of the Number of Tree-Child Networks

Michael Fuchs, Guan-Ru Yu, Louxin Zhang

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with leaves has the factor in its main asymptotic growth term. In…

math.CO2019

A note on algebraic connectivity of 2-connected graphs

Guanglong Yu, by Shuguang Guo, Lin Sun +2

Among all simple 2-connected graphs, and among all -graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.

math.CO2019

Least -eigenvalues of nonbipartite 2-connected graphs

Guanglong Yu, by Lin Sun, Chao Yan +2

Among all simple nonbipartite 2-connected graphs and among all nonbipartite -graphs, the minimum least -eigenvalues are completely determined, respectively.