Jiang-Chao Wan

activity

20182026

most citedEigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue

11 citations · 15 across the 12 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product

Jiang-Chao Wan, Yi Wang

Let $(k [ n ])$ be the set of all $k$ -element subsets of the set ${1, \dots, n}$ and let $A, B \subseteq (k [ n ])$ be two cross-intersecting families,…

math.CO2026

A solution to Csikvári's conjecture and the largest matching root of $k$ -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 thresh…

math.CO2026

Perturbation of the largest matching root of hypergraphs

Jiang-Chao Wan, Yi Wang

The largest matching root of a $k$ -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…

An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product

A solution to Csikvári's conjecture and the largest matching root of k-graphs

Perturbation of the largest matching root of hypergraphs

A solution to Csikvári's conjecture and the largest matching root of $k$ -graphs