25 citations · 35 across the 11 of their papers we have counts for
11 papers
MaxCut in graphs with sparse neighborhoods
Jinghua Deng, Jianfeng Hou, Siwei Lin +1
Let be a graph with edges and let denote the size of a largest cut of . The difference is called the surplus of $G…
Extremal graphs for the suspension of edge-critical graphs
Jianfeng Hou, Heng Li, Qinghou Zeng
The Turán number of a graph , , is the maximum number of edges in an -vertex graph that does not contain as a subgraph. For a vertex and a multi-set $…
Two stability theorems for -saturated hypergraphs
Jianfeng Hou, Heng Li, Caihong Yang +2
An -saturated -graph is a maximal -graph not containing any member of as a subgraph. Let be the collection of all -…
Generating non-jumps from a known one
Jianfeng Hou, Heng Li, Caihong Yang +1
Let be an integer. The real number is a jump for if there exists a constant such that for any and any integer , there exists an in…
Hypergraphs with infinitely many extremal constructions
Jianfeng Hou, Heng Li, Xizhi Liu +2
We give the first exact and stability results for a hypergraph Turán problem with infinitely many extremal constructions that are far from each other in edit-distance. This include…
Uniform tight frames as optimal signals
Gergely Ambrus, Bo Bai, Jianfeng Hou
Non-orthogonal communication is a promising technique for future wireless networks (e.g., 6G and Wi-Fi 7). In the vector channel model, designing efficient non-orthogonal communica…