Jing Wang

activity

20212026

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Spectral Turán Problems for Expanded hypergraphs

Zhenyu Ni, Dongquan Cheng, Jing Wang +1

Given a graph $F$ , the expansion $F^{(r)}$ of $F$ is defined as the $r$ -uniform hypergraph obtained from $F$ by adding a set of $(r - 2)$ distinct new vertices to each edge of $F$ . I…

math.CO2024

Hypergraph Extensions of Spectral Turán Theorem

Lele Liu, Zhenyu Ni, Jing Wang +1

The spectral Turán theorem states that the $k$ -partite Turán graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no t…

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.CO2023

Spectral extremal graphs for edge blow-up of star forests

Jing Wang, Zhenyu Ni, Liying Kang +1

The edge blow-up of a graph $G$ , denoted by $G^{p + 1}$ , is obtained by replacing each edge of $G$ with a clique of order $p + 1$ , where the new vertices of the cliques are all distinc…

math.CO2022

On a conjecture of spectral extremal problems

Jing Wang, Liying Kang, Yusai Xue

For a simple graph $F$ , let $Ex (n, F)$ and $E x_{sp} (n, F)$ denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectra…

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…