Guanghui Wang

activity

20222026

collaborators

7 papers

math.CO2026

A double-exponential lower bound for $r_{4} (5, n)$

Longma Du, Xinyu Hu, Ruilong Liu +1

The Ramsey number $r_{k} (s, n)$ is the smallest integer $N$ such that every $N$ -vertex $k$ -graph contains either a copy of $K_{s}^{(k)}$ or an independent set of size $n$ . We prove that…

math.CO2026

A Note on Generalized Erdős-Rogers Problems

Longma Du, Xinyu Hu, Ruilong Liu +1

For a $k$ -uniform hypergraph $F$ and positive integers $s$ and $N$ , the generalized Erdős-Rogers function $f_{F, s}^{(k)} (N)$ denotes the largest integer $m$ such that every $K_s^{(…

math.CO2026

A step towards the Erdős-Rogers problem

Longma Du, Xinyu Hu, Ruilong Liu +1

For $2 \leq k \leq t < s$ , the Erdős-Rogers function $f_{t, s}^{(k)} (N)$ denotes the largest $m$ such that every $K_{s}^{(k)}$ -free $k$ -graph on $N$ vertices contains a $K_{t}^{(k)}$ -free ind…

math.CO2026

Extremal problems in uniformly dense hypergraphs and digraphs

Hao Lin, Guanghui Wang, Wenling Zhou +1

The uniform Turán density $π_{u} (F)$ of a $3$ -uniform hypergraph (or $3$ -graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$ -free $3$ -graphs $H$ in whic…

math.CO2025

Degree conditions for spanning expansion hypertrees

Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2

The $k$ -expansion of a graph $G$ is the $k$ -uniform hypergraph obtained from $G$ by adding $k - 2$ new vertices to every edge. We determine, for all $k > d \geq 1$ , asymptotically op…

math.CO2024

A strengthening on consecutive odd cycles in graphs of given minimum degree

Hao Lin, Guanghui Wang, Wenling Zhou

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$ -connected non-bipartite graph with minimum degree at least $k + 1$ contains $⌈ k /2 ⌉$ cycles with con…

A double-exponential lower bound for r4​(5,n)

A Note on Generalized Erdős-Rogers Problems

A step towards the Erdős-Rogers problem

Extremal problems in uniformly dense hypergraphs and digraphs

Degree conditions for spanning expansion hypertrees

A strengthening on consecutive odd cycles in graphs of given minimum degree

A double-exponential lower bound for $r_{4} (5, n)$