Guanghui Wang

activity

20212026

collaborators

Showing 2026Show all

9 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…

cs.CC2026

On the Intractability of the Minimum Distance Problem for Regular LDPC Codes

Chenyuan Jia, Qingqing Peng, Ke Liu +2

The minimum distance problem (MDP) for low-density parity-check (LDPC) codes is a central problem in coding theory and is closely related to the analysis of low-weight codewords an…

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…

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

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

On the Intractability of the Minimum Distance Problem for Regular LDPC Codes

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)

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)$