4 papers
A solution to Csikvári's conjecture and the largest matching root of -graphs
Jiang-Chao Wan, Yi Wang
In 2011, Csikvári [Electron. J. Combin. {\bf 18} (2011), P182] proved that among all graphs with a prescribed number of edges, the largest matching root is attained by a thres…
Perturbation of the largest matching root of hypergraphs
Jiang-Chao Wan, Yi Wang
The largest matching root of a -graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In…
A hypergraph Heilmann--Lieb theorem
Jiang-Chao Wan, Yi Wang, Yi-zheng Fan
The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs.…
Subdivision method in the Laplacian matching polynomial
Jiang-Chao Wan, Yi Wang, Zhi-Yuan Wang
As a bridge connecting the matching polynomial and the Laplacian matching polynomial of graphs, the subdivision method is expected to be useful for investigating the Laplacian matc…