L. Kang

activity

20142023

most citedOn the principal eigenvectors of uniform hypergraphs

20 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Solution to a Forcible Version of a Graphic Sequence Problem

Mao-cheng Cai, Liying Kang

Let $A_{n} = (a_{1}, a_{2}, \dots, a_{n})$ and $B_{n} = (b_{1}, b_{2}, \dots, b_{n})$ be nonnegative integer sequences with $A_{n} \leq B_{n}$ . The purpose of this note is to give a good characterization such t…

math.CO2021

Spectral extremal graphs for intersecting cliques

Dheer Noal Desai, Liying Kang, Yongtao Li +3

The $(k, r)$ -fan is the graph consisting of $k$ copies of the complete graph $K_{r}$ which intersect in a single vertex, and is denoted by $F_{k, r}$ . Erdős, Füredi, Gould and Gunderso…

math.CO2021★ 1 cited

Anti-Ramsey number of matchings in $r$ -partite $r$ -uniform hypergraphs

Yisai Xue, Erfang Shan, Liying Kang

An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs $H$ and $G$ , the anti-Ramsey number $ar(\mathcal{G}, \mat…

Solution to a Forcible Version of a Graphic Sequence Problem

Spectral extremal graphs for intersecting cliques

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs

Anti-Ramsey number of matchings in $r$ -partite $r$ -uniform hypergraphs