10 papers
Asymptotically optimal packings of arithmetic progressions with prime differences
Jianfeng Hou, Siyue Liu, Hongbin Zhao
For a positive integer , put for and for . For , let $m…
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…
Local and global average degree in bipartite graphs
Jianfeng Hou, Hongbin Zhao
Let denote the maximum, over all -vertex bipartite graphs without isolated vertices, of the ratio of the minimum local average degree to the global average…
An Improved Upper Bound for Finite Sidon Sets via Vector-Valued Smoothing
Jianfeng Hou, Hongbin Zhao
Let denote the largest cardinality of a Sidon subset of . We prove \[ F(N)\le N^{1/2}+γ_0N^{1/4}+O(1), \qquad γ_0=0.94349\ldots<0.9435. \] This improves…
Turán numbers of -uniform tight even cycles minus one edge
Wanfang Chen, Jianfeng Hou, Xizhi Liu +2
For every integer and sufficiently large , we show that the extremal construction for the Turán number of the -uniform tight cycle of length minus one edge i…
On cliques in hypergraphs under bounded -norm
Jianfeng Hou, Hongbin Zhao
Let be an -uniform hypergraph. For , let be the number of edges of containing , and define the $…