Guanghui Wang

activity

20212026

most citedInteger colorings with no rainbow 3-term arithmetic progression

5 citations · 5 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

12 papers · 1 filter

math.CO2026

The Erdős--Hajnal hypergraph Ramsey problem for $r_{4} (6, 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$ . Erdős and Haj…

math.CO2026

Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense $3$ -Graphs

Hao Lin, Guanghui Wang, Wenling Zhou

A $3$ -uniform hypergraph (or $3$ -graph) $H$ on $n$ vertices is \emph{ $(n, d, μ)$ -dense} if $e_{H} (X, Y, Z) \geq d ∣ X ∣∣ Y ∣∣ Z ∣ - μ n^{3}$ for all $X, Y, Z \subseteq V (H)$ . This is one of the weakest s…

math.CO2026

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

Hanzhi Bai, Longma Du, Xinyu Hu +2

The Ramsey number $r_{k} (s, m)$ is the smallest $N$ such that any red/blue coloring of the $k$ -subsets of $[N]$ contains a red $s$ -set or a blue $m$ -set. For fixed $k$ and $s$ , and fo…

math.CO2026

Uniform Turán densities of $k$ -uniform hypergraphs

Hao Lin, Guowei Sun, Guanghui Wang +1

For $k \geq 3$ , the $(k - 2)$ -uniform Turán density $π_{k - 2} (F)$ of a $k$ -graph $F$ is the supremum of $d$ for which there are arbitrarily large $F$ -free $k$ -graphs that are uniformly…

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…

math.CO2022

Integer colorings with no rainbow $k$ -term arithmetic progression

Hao Lin, Guanghui Wang, Wenling Zhou

In this paper, we study the rainbow Erdős-Rothschild problem with respect to $k$ -term arithmetic progressions. For a set of positive integers $S \subseteq [n]$ , an $r$ -coloring of…

math.CO2021★ 5 cited

Integer colorings with no rainbow 3-term arithmetic progression

Xihe Li, Hajo Broersma, Ligong Wang

In this paper, we study the rainbow Erdős-Rothschild problem with respect to 3-term arithmetic progressions. We obtain the asymptotic number of $r$ -colorings of $[n]$ without rainb…

The Erdős--Hajnal hypergraph Ramsey problem for r4​(6,n)

Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense 3-Graphs

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

Uniform Turán densities of k-uniform hypergraphs

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

Integer colorings with no rainbow k-term arithmetic progression

Integer colorings with no rainbow 3-term arithmetic progression

The Erdős--Hajnal hypergraph Ramsey problem for $r_{4} (6, n)$

Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense $3$ -Graphs

Uniform Turán densities of $k$ -uniform hypergraphs

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

Integer colorings with no rainbow $k$ -term arithmetic progression