2 papers
math.CO2026
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…
math.CO2025
Tight bounds towards Zarankiewicz problem in hypergraph
Guorong Gao, Jianfeng Hou, Shuping Huang +1
The classical Zarankiewicz problem, which concerns the maximum number of edges in a bipartite graph without a forbidden complete bipartite subgraph, motivates a direct analogue for…