Jianfeng Hou

activity

20232026

most citedToward a density Corrádi--Hajnal theorem for degenerate hypergraphs

1 citations · 2 across the 34 of their papers we have counts for

collaborators

Showing 2026Show all

18 papers · 1 filter

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…

math.CO2026

Feedback edge set in bipartite digraph

Bin Chen, Jianfeng Hou, Siyue Liu

Let $β(G)$ denote the minimum size of a feedback edge set of a digraph $G$, and let $γ(G)$ denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chud…

math.CO2026

On the Erdős Five-Edge Intersection Problem

Chengrui Fang, Jianfeng Hou

For an $n$ -vertex graph $G$ and a permutation $π$ of its vertex set, let \[ I_G(π)=|E(G)\cap E(G_π)|,\qquad μ(G)=\min_π I_G(π), \] where $G_{π}$ is the copy of $G$ obtained by relabe…

math.CO2026

On the Generalized Rational Exponents Conjecture

Jianfeng Hou, Caihong Yang

For fixed graphs $H$ and $F$ , let $\ex(n,H,F)$ denote the maximum number of copies of $H$ in an $n$ -vertex $F$ -free graph. In this note, we prove the generalized rational exponents…

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

Non-trivial Intersection Problems for Multi-partite Hypergraphs

Jianfeng Hou, Caiyun Hu

We study non-trivial intersection problems for multi-partite hypergraphs, excluding the usual extremal examples determined by fixed vertices or fixed coordinates. Our first result…

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…

cs.LG2026

A Spectral Theory of Normalized Corrected GNN Propagation

Qihan Chen, Wei Li, Meng Qin +1

We develop a spectral theory for \emph{normalized corrected GNN propagation}. The object of study is the symmetric normalized adjacency with its degree-stationary component removed…

math.CO2026

Fixed-density profiles for the semi-induced 4-vertex star

Jinghua Deng, Jianfeng Hou

We study the fixed-density semi-inducibility profiles of the red-blue star $S_{2, 1}$ , which has one distinguished center, two red edges and one blue edge. For an $n$ -vertex graph $…

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

Explicit thresholds in a generalized Turán problem for $K_{3,t}$-free graphs

Jianfeng Hou, Caiyun Hu, Hezhi Wang

For graphs $F$ and $H$ , let $\ex(n,F,H)$ denote the maximum number of copies of $F$ in an $n$ -vertex $H$ -free graph. Janzer, Longbrake and Yepremyan recently proved that, for fixed…

math.CO2026

On saturation problems involving clique number and matching number

Zian Chen, Guorong Gao, Jianfeng Hou +1

For a clique $K_{r}$ , a graph is $K_{r}$ -saturated if it contains no copy of $K_{r}$ and the addition of any edge from its complement creates a $K_{r}$ . A classical result of Erdős-Hajnal-…

math.CO2026

Vertex-colored Turán theorems with applications in extremal hypergraph problems

Wanfang Chen, Jinghua Deng, Jianfeng Hou +2

Balogh, Clemen, and Lidický proved that the $ℓ_{2}$ -norm Turán problem for $K_{5}^{3}$ is asymptotically solved by the balanced bipartite construction, and they further conjectu…

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

The Erdős Matching Conjecture for 4-uniform hypergraphs

Jianfeng Hou, Caiyun Hu, Xizhi Liu

We prove the Erdős Matching Conjecture for $4$ -uniform hypergraphs for every matching number $s \geq 6004$ . Specifically, for integers $s \geq 6004$ and $n \geq 4 s + 4$ , if a $n$ -vertex 4-u…

math.CO2026

A note on the $t$ -partite link problem of Füredi

Jianfeng Hou, Xinmin Hou, Xizhi Liu +2

Motivated by the Erdős--Sós bipartite link conjecture, Füredi (Oberwolfach, 2004) asked for the asymptotic maximum edge density $π_{link} (t)$ of $3$ -graphs in which the li…

Equal subset sums and close divisors

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

Feedback edge set in bipartite digraph

On the Erdős Five-Edge Intersection Problem

On the Generalized Rational Exponents Conjecture

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

Non-trivial Intersection Problems for Multi-partite Hypergraphs

Local versus global average degree in bipartite graphs

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

A Spectral Theory of Normalized Corrected GNN Propagation

Fixed-density profiles for the semi-induced 4-vertex star

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

Explicit thresholds in a generalized Turán problem for \(K_{3,t}\)-free graphs

On saturation problems involving clique number and matching number

Vertex-colored Turán theorems with applications in extremal hypergraph problems

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

The Erdős Matching Conjecture for 4-uniform hypergraphs

A note on the t-partite link problem of Füredi

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

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

A note on the $t$ -partite link problem of Füredi