Skip to content

Author

Jianfeng Hou

We have 7 of 40 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Feedback edge set in bipartite digraph

Let \(\beta(G)\) denote the minimum size of a feedback edge set of a digraph \(G\), and let \(\gamma(G)\) denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chudnovsky--Seymour--Sullivan conjecture for \(3\)-free digraphs, we study the corresponding feedback-edge problem for bipartite digrap...

Bin Chen, Jian-Feng Hou, Si-Yue Liu · 0 citations
Preprint Oct 2026

A near-quadratic lower bound for sets with no unique sums

Let $m(p)$ be the least size of a subset of $\F_p$ with at least two elements for which every sum has two distinct representations as unordered pairs, allowing repetition. We prove that, for every prime $p\ge64$, \[ m(p)\ge2^{-80}\left(\frac{\log p}{\log\log p}\right)^2. \] The argument compresses the full integer coll...

Jian-Feng Hou, Kai Yang · 0 citations
Preprint Sep 2026

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

A family $\mathcal F$ of finite subsets of $\mathbb Z$ is packed into $[N]$ if suitable integer translates of its members are pairwise disjoint subsets of $[N]$. We study two prescribed-difference packing problems of Alon, D\k{e}bski, Grytczuk and Przyby{\l}o for the arithmetic progressions $A_d=\{d,2d,\ldots,\lfloor n...

Jian-Feng Hou, Si-Yue Liu, Hong-Bin Zhao · 0 citations
Preprint Aug 2026

On the Erd\H{o}s Five-Edge Intersection Problem

For an $n$-vertex graph $G$ and a permutation $\pi$ of its vertex set, let \[ I_G(\pi)=|E(G)\cap E(G_{\pi})|,\qquad \mu(G)=\min_{\pi} I_G(\pi), \] where $G_{\pi}$ is the copy of $G$ obtained by relabelling every vertex $x\in V(G)$ as $\pi(x)$. Let $f(n,k)$ be the minimum number of edges in an $n$-vertex graph $G$ satis...

Chengrui Fang, Jian-Feng Hou · 1 citation
Preprint Sep 2026

Equal subset sums and close divisors

For $k\geq2$, let $\alpha_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)^{-a}$. Select each positive integer $i$ independently with probability $1/i$, forming a random set $\mathbf A$, and let $\beta_k$ be th...

Jian-Feng Hou, Hong-Bin Zhao · 0 citations
Preprint Sep 2026

Asymptotically optimal packings of arithmetic progressions with prime differences

For a positive integer $n$, put $A_d=\{id:1\le i\le\lfloor n/d\rfloor\}$ for $1\le d\le n$ and $B_d=\{id:1\le i\le n\}$ for $d\in\mathbb{N}$. For $D\subseteq\{1,\ldots,n\}$, let $m_D(n)$ be the minimum length of an integer interval containing pairwise disjoint shifted copies of $A_d$ for all $d\in D$. For a finite set...

Jian-Feng Hou, Si-Yue Liu, Hong-Bin Zhao · 0 citations
Preprint Aug 2026

On the Generalized Rational Exponents Conjecture

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 conjecture, posed by Gerbner and Palmer, showing that for every rational number $\alpha\ge1$, there exist fixed graphs $H_\alpha$ and $F_\a...

Jian-Feng Hou, Caihong Yang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.