From the 1 of 9 linked papers with an AI index.
9 papers
Local and global average degree in bipartite graphs
Jianfeng Hou, Hongbin Zhao
The paper determines the asymptotic value of the maximum ratio between the smallest local average degree and the overall average degree in n‑vertex bipartite graphs without isolate…
Vector-valued smoothing for finite Sidon sets
Jianfeng Hou, Hongbin Zhao
Let denote the largest cardinality of a Sidon subset of . We prove \[ F(N)\le N^{1/2}+0.9435N^{1/4}+O(1). \] The argument uses a vector-valued convolutio…
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…
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 $…
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…
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 -uniform hypergraph with three edges is bounded from above by . For even , this bound is ti…