Liying Kang

collaborators

5 papers

math.CO2024

Extremal problems for star forests and cliques

Yongchun Lu, Liying Kang

Given a family of graphs $F$ , the Turán number $e x (n, F)$ denotes the maximum number of edges in any $F$ -free graph on $n$ vertices. Recently, Alon an…

math.CO2023

Extremal problems for disjoint graphs

Zhenyu Ni, Jing Wang, Liying Kang

For a simple graph $F$ , let $EX (n, F)$ and $E X_{sp} (n, F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral ra…

math.CO2022

Spectral extremal graphs for disjoint cliques

Zhenyu Ni, Jing Wang, Liying Kang

The $k K_{r + 1}$ is the union of $k$ disjoint copies of $(r + 1)$ -clique. Moon [Canad. J. Math. 20 (1968) 95--102] and Simonovits [Theory of Graphs (Proc. colloq., Tihany, 1996)] indep…

math.CO2022

Spectral Turán Type Problems on Cancellative Hypergraphs

Zhenyu Ni, Lele Liu, Liying Kang

Let $G$ be a cancellative $3$ -uniform hypergraph in which the symmetric difference of any two edges is not contained in a third one. Equivalently, a $3$ -uniform hypergraph $G$ is c…

math.CO2016

Extremal hypergraphs for matching number and domination number

Erfang Shan, Yanxia Dong, Liying Kang +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 $\math…