Liying Kang

activity

20142022

most citedLinear spectral Turan problems for expansions of graphs with given chromatic number

4 citations · 7 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022★ 4 cited

Linear spectral Turan problems for expansions of graphs with given chromatic number

Chuan-Ming She, Yi-Zheng Fan, Liying Kang +1

An $r$ -uniform hypergraph is linear if every two edges intersect in at most one vertex. The $r$ -expansion $F^{r}$ of a graph $F$ is the $r$ -uniform hypergraph obtained from $F$ by…

math.CO2017★ 1 cited

Domination in intersecting hypergraphs

Yanxia Dong, Erfang Shan, Shan Li +1

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $α^{'} (H)$ of $H$ is the size of a maximum matching in $H$ . A subset $D$ of vertices of $H…

math.CO2014

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs

Erfang Shan, Yuxiao Sun, Liying Kang

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $H (G)$ , of a…

Linear spectral Turan problems for expansions of graphs with given chromatic number

Domination in intersecting hypergraphs

Coloring clique-hypergraph of K5​-minor-free graphs

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs