collaborators

10 papers

math.CO2026

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

Hao Lin, Guanghui Wang, Wenling Zhou

A -uniform hypergraph (or -graph) on vertices is \emph{-dense} if for all . This is one of the weakest…

cs.CC2026

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

Chenyuan Jia, Qingqing Peng, Ke Liu +2

The paper investigates the computational difficulty of determining the minimum distance of regular LDPC codes, proving NP‑completeness and W[1]‑completeness for various left‑regula…

math.CO2026

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

Hanzhi Bai, Longma Du, Xinyu Hu +2

The Ramsey number is the smallest such that any red/blue coloring of the -subsets of contains a red -set or a blue -set. For fixed and , and fo…

math.CO2026

Uniform Turán densities of -uniform hypergraphs

Hao Lin, Guowei Sun, Guanghui Wang +1

For , the -uniform Turán density of a -graph is the supremum of for which there are arbitrarily large -free -graphs that are uniforml…

math.CO2026

A double-exponential lower bound for

Longma Du, Xinyu Hu, Ruilong Liu +1

The Ramsey number is the smallest integer such that every -vertex -graph contains either a copy of or an independent set of size . We prove that…

math.CO2026

A Note on Generalized Erdős-Rogers Problems

Longma Du, Xinyu Hu, Ruilong Liu +1

For a -uniform hypergraph and positive integers and , the generalized Erdős-Rogers function denotes the largest integer such that every $K_s^{…