Honghai Li

activity

20142025

most citedThe extremal spectral radii of

k

-uniform supertrees

17 citations · 23 across the 12 of their papers we have counts for

collaborators

Showing 2025Show all

5 papers · 1 filter

math.CO2025

Thin divisible designs graphs: an interplay between fixed-point free involutions of $(v, k, λ)$ -graphs and symmetric weighing matrices

Sergey Goryainov, Willem H. Haemers, Elena V. Konstantinova +1

In this paper, we illustrate important aspects of the interplay between weighing matrices, $(v, k, λ)$ -graphs with fixed-point free involutions, and signed graphs with an orthogonal…

math.CO2025

Spectral extremal problems for the $(p, Q)$ -spectral radius of hypergraphs

Jian Zheng, Honghai Li, Li Su

Let $Q$ be an $s$ -vertex $r$ -uniform hypergraph, and let $H$ be an $n$ -vertex $r$ -uniform hypergraph. Denote by $N (Q, H)$ the number of isomorphic copies of $Q$ in $H$ . Fo…

math.CO2025

Spectral Turán-type problems for the $α$ -spectral radius of hypergraphs with degree stability

Jian Zheng, Honghai Li, Li Su

An $r$ -pattern $P$ is an ordered pair $P = ([l], E)$ , where $l$ is a positive integer and $E$ is a set of $r$ -multisets with elements from $[l]$ . An $r$ -graph $H$ is said to be $P$ -co…

math.CO2025

The signless Laplacian spectral Turán problems for color-critical graphs

Jian Zheng, Yongtao Li, Honghai Li

The well-known Turán theorem states that if $G$ is an $n$ -vertex $K_{r + 1}$ -free graph, then $e (G) \leq e (T_{n, r})$ , with equality if and only if $G$ is the $r$ -partite Turán graph $T…

math.CO2025

A signless Laplacian spectral Erdös-Stone-Simonovits theorem

Jian Zheng, Honghai Li, Li Su

The celebrated Erdős--Stone--Simonovits theorem states that $ex (n, F) = (1 - \frac{1}{χ ( F ) - 1} + o (1)) \frac{n ^{2}}{2}$ , where $χ (F)$ is the chromatic number of $F$ . In 2…

Thin divisible designs graphs: an interplay between fixed-point free involutions of (v,k,λ)-graphs and symmetric weighing matrices

Spectral extremal problems for the (p,Q)-spectral radius of hypergraphs

Spectral Turán-type problems for the α-spectral radius of hypergraphs with degree stability

The signless Laplacian spectral Turán problems for color-critical graphs

A signless Laplacian spectral Erdös-Stone-Simonovits theorem

Thin divisible designs graphs: an interplay between fixed-point free involutions of $(v, k, λ)$ -graphs and symmetric weighing matrices

Spectral extremal problems for the $(p, Q)$ -spectral radius of hypergraphs

Spectral Turán-type problems for the $α$ -spectral radius of hypergraphs with degree stability