2 papers
math.CO2026
Graded discrepancy of graphs and hypergraphs
Yanling Chen, Shuping Huang, Qinghou Zeng
This paper studies the following question of Bollobás and Scott: Let be a graph with vertices and edges. What is the smallest such that there is…
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…