Hong-Bin Zhao

activity

20242026

collaborators

11 papers

math.NT2026

Equal subset sums and close divisors

Jianfeng Hou, Hongbin Zhao

For $k \geq 2$ , let $α_{k}$ be the supremum of the exponents $a$ for which almost every integer $n$ has $k$ distinct divisors in a multiplicative interval of relative length $(\log n)^…

math.NT2026

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

Jianfeng Hou, Siyue Liu, Hongbin Zhao

A family $F$ of finite subsets of $Z$ is packed into $[N]$ if suitable integer translates of its members are pairwise disjoint subsets of $[N]$ . We study two presc…

cs.DS2026

Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs

Jianfeng Hou, Hongbin Zhao

We study the exact enumeration of maximal cliques in graph classes defined by excluded clique minors and excluded clique immersions. For n-vertex K_t-minor-free graphs, we give an…

math.CO2026

Local versus global average degree in bipartite graphs

Jianfeng Hou, Hongbin Zhao

Let $F_{bip} (n)$ denote the maximum, over all $n$ -vertex bipartite graphs without isolated vertices, of the ratio of the minimum local average degree to the global average…

math.CO2026

An Improved Upper Bound for Finite Sidon Sets via Vector-Valued Smoothing

Jianfeng Hou, Hongbin Zhao

Let $F (N)$ denote the largest cardinality of a Sidon subset of ${0, 1, \dots, N - 1}$ . We prove \[ F(N)\le N^{1/2}+γ_0N^{1/4}+O(1), \qquad γ_0=0.94349\ldots<0.9435. \] This improves…

math.CO2026

Turán numbers of $4$ -uniform tight even cycles minus one edge

Wanfang Chen, Jianfeng Hou, Xizhi Liu +2

For every integer $k \geq 1$ and sufficiently large $n$ , we show that the extremal construction for the Turán number of the $4$ -uniform tight cycle of length $4 k + 2$ minus one edge i…

math.CO2026

On cliques in hypergraphs under bounded $(j, p)$ -norm

Jianfeng Hou, Hongbin Zhao

Let $H$ be an $r$ -uniform hypergraph. For $S \in (j V ( H ))$ , let $deg (S)$ be the number of edges of $H$ containing $S$ , and define the $…

math.CO2025

Odd hypergraph Mantel theorems

Jianfeng Hou, Xizhi Liu, Yixiao Zhang +2

A classical result of Sidorenko (1989) shows that the Turán density of every $r$ -uniform hypergraph with three edges is bounded from above by $1/2$ . For even $r$ , this bound is tig…

math.CO2025

Exact Turán densities in triple systems

Nannan Chen, Yuzhen Qi, Caihong Yang +1

In this paper, we prove several new Turán density results for $3$ -graphs. We show: $π (C_{4}^{3}, complement of F_{5}) = 23 - 3$ , $π (F_{3, 2}, C_{5}^{3 -}) = \frac{2}{9}$ ,…

math.CO2025

Turán density of tight cycles minus one edge in the $ℓ_{2}$ -norm

Levente Bodnár, Jinghua Deng, Jianfeng Hou +2

The $3$ -uniform tight $ℓ$ -cycle minus one edge $C_{ℓ}^{3 -}$ is the $3$ -graph on $ℓ$ vertices consisting of $ℓ - 1$ consecutive triples in the cyclic order. We show that f…

math.CO2024

A criterion for Andrásfai--Erdős--Sós type theorems and applications

Jianfeng Hou, Xizhi Liu, Hongbin Zhao

The classical Andrásfai--Erdős--Sós Theorem states that for $ℓ \geq 2$ , every $n$ -vertex $K_{ℓ + 1}$ -free graph with minimum degree greater than $\frac{3 ℓ - 4}{3 ℓ - 1} n$ must b…

Equal subset sums and close divisors

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs

Local versus global average degree in bipartite graphs

An Improved Upper Bound for Finite Sidon Sets via Vector-Valued Smoothing

Turán numbers of 4-uniform tight even cycles minus one edge

On cliques in hypergraphs under bounded (j,p)-norm

Odd hypergraph Mantel theorems

Exact Turán densities in triple systems

Turán density of tight cycles minus one edge in the ℓ2​-norm

A criterion for Andrásfai--Erdős--Sós type theorems and applications

Turán numbers of $4$ -uniform tight even cycles minus one edge

On cliques in hypergraphs under bounded $(j, p)$ -norm

Turán density of tight cycles minus one edge in the $ℓ_{2}$ -norm