activity
20242026
most citedSpectral supersaturation: Triangles and bowties

5 citations · 11 across the 17 of their papers we have counts for

collaborators

17 papers

math.CO2026

Spectral extremal hypergraphs without long Berge cycles

Lihua Feng, Lu Lu, Tingzeng Wu

Let and be fixed integers. We determine, for all sufficiently large , the maximum adjacency-tensor spectral radius of an -vertex -uniform hypergraph c…

math.CO2026

Rigidity and stability for biased cross-intersecting families

Yongjiang Wu, Lihua Feng

Let and belong to , and let and be the associated measures on . Suppos…

math.CO2026

The binomial norm of intersecting-union families

Yongjiang Wu, Lihua Feng

In a 2021 survey on Katona's circle method, Frankl conjectured that every family in which any two members intersect and no two members cover sa…

math.CO2026

Random partition for Tokushige's -wise intersecting conjecture

Yongjiang Wu, Lihua Feng

Let and let . Let denote the product measure on where each coordinate is included independently with probabil…

math.CO2026

Bollobás-type inequalities for subspaces via weight invariance

Zhiyi Liu, Lihua Feng, Tingzeng Wu

Let be an -dimension real vector space with a direct sum decomposition . Let be a skew Bollobás…

math.CO2026

Subspace variations of the weighted skew Bollobás theorem

Yongjiang Wu, Yongtao Li, Lu Lu +1

Let be a finite-dimensional real vector space. A collection of pairs of subspaces of is called a skew Bollobás system if $\dim(A_i\cap…

math.CO2025

The number of rooted spanning forests of bicirculant graphs

Jing Yang, Lihua Feng, Rongrong Lu +1

A bi-Cayley graph over the cyclic group is called a bicirculant graph. Let be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\s…

math.CO2025

The product measures of cross -intersecting families

Yongjiang Wu, Yongtao Li, Zhiyi Liu +1

We investigate the product measures of intersection problems in extremal combinatorics. Invoking a recent result of He--Li--Wu--Zhang, we prove that for any and…

math.CO2025

Non-uniform pairwise cross -intersecting families

Yongjiang Wu, Yongtao Li, Tingzeng Wu +1

Let and be non-empty families. We say that they are pairwise cross -intersecting if $|A…

math.CO2025

Two results on set families: sturdiness and intersection

Yongjiang Wu, Zhiyi Liu, Lihua Feng +1

This paper resolves two open problems in extremal set theory. For a family and , we denote $\mathcal{F} (i,\bar{j})=\{F\backslash\{i\}:…

math.CO2025

Spectral extremal problems for non-bipartite graphs without odd cycles

Lantao Zou, Lihua Feng, Yongtao Li

A well-known result of Mantel asserts that every -vertex triangle-free graph has at most edges. Moreover, Erdős proved that if is further non-bip…

math.CO2024★ 1 cited

A result for hemi-bundled cross-intersecting families

Yongjiang Wu, Lihua Feng, Yongtao Li

Two families and are called cross-intersecting if for every and , the intersection is non-empty. It is si…

math.CO2024

Stabilities of the Kleitman diameter theorem

Yongjiang Wu, Yongtao Li, Lihua Feng +2

Let be a family of subsets of . The diameter of is the maximum size of symmetric differences among pairs of its members. Resolving a conjecture of…

math.CO2024

Maximal intersecting families revisited

Yongjiang Wu, Yongtao Li, Lihua Feng +2

The well-known Erdős--Ko--Rado theorem states that for , every intersecting family of -sets of has at most sets, and the extre…

math.CO2024

A spectral Lovász-Simonovits theorem

Yongtao Li, Lihua Feng, Yuejian Peng

A fundamental result in extremal graph theory is attributed to Mantel's theorem, which states that every graph on vertices with more than edges must con…

math.CO2024★ 5 cited

Spectral supersaturation: Triangles and bowties

Yongtao Li, Lihua Feng, Yuejian Peng

Recently, Ning and Zhai (2023) proved that every -vertex graph with has at least triangles, unless $G=K_{\lcei…

math.CO2024★ 5 cited

A spectral Erdős-Faudree-Rousseau theorem

Yongtao Li, Lihua Feng, Yuejian Peng

A well-known theorem of Mantel states that every -vertex graph with more than edges contains a triangle. An interesting problem in extremal graph theory…