3 papers
math.CO2026
Rational codegree Turán density of hypergraphs
Jun Gao, Oleg Pikhurko, Mingyuan Rong +1
Let be a -graph (i.e. a -uniform hypergraph). Its minimum codegree is the largest integer such that every -subset of is contained in at lea…
math.MG2025
New upper bound for lattice covering by spheres
Jun Gao, Xizhi Liu, Oleg Pikhurko +1
We show that there exists a lattice covering of by Eucledian spheres of equal radius with density as , where \begin{align*} β:= \…
math.CO2025
On the quadratic 8-edge case of the Brown-Erdős-Sós problem
Oleg Pikhurko, Shumin Sun
Let be the maximum number of edges in an -vertex -uniform hypergraph containing no edges on at most vertices. Brown, Erdős and Sós conjectured in 197…