From the 1 of 29 linked papers with an AI index.
26 papers · 1 filter
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…
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 , which has one distinguished center, two red edges and one blue edge. For an -vertex graph $…
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…
Explicit thresholds in a generalized Turán problem for \(K_{3,t}\)-free graphs
Jianfeng Hou, Caiyun Hu, Hezhi Wang
For graphs and , let $\ex(n,F,H)$ denote the maximum number of copies of in an -vertex -free graph. Janzer, Longbrake and Yepremyan recently proved that, for fixed…
On saturation problems involving clique number and matching number
Zian Chen, Guorong Gao, Jianfeng Hou +1
For a clique , a graph is -saturated if it contains no copy of and the addition of any edge from its complement creates a . A classical result of ErdÅs-Hajnal…