Guorong Gao

collaborators

4 papers

math.CO2026

Tight bound for the skew Hamming set-pair problem

Guorong Gao, Run Zhao

Let $X$ be an alphabet, let $t \geq 0$ and $n \geq t + 1$ , and let $((a_{i}, b_{i}))_{i = 1}^{m}$ be an ordered family of word pairs in $X^{n}$ satisfying $d i s t (a_{i}, b_{i}) \geq t + 1$ for every $i$ …

math.CO2026

Spectral Radius Conditions for 3-Uniform Intersecting Families

Lusheng Fang, Guorong Gao, An Chang

Let $M_{k}$ denote a matching of size $k$ . The classical ErdÅs matching conjecture asks for the maximum number of edges of an intersecting $r$ -graph without $M_{k}$ . The csae for $k=2…

math.CO2026

On saturation problems involving clique number and matching number

Zian Chen, Guorong Gao, Jianfeng Hou +1

For a clique $K_{r}$ , a graph is $K_{r}$ -saturated if it contains no copy of $K_{r}$ and the addition of any edge from its complement creates a $K_{r}$ . A classical result of ErdÅs-Hajnal…

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…