Dingyuan Liu

activity

20242026

collaborators

12 papers

math.CO2026

The number of regular simplices in higher dimensions

Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

We study the extremal function $S_{d}^{k} (n)$ , defined as the maximum number of regular $(k - 1)$ -simplices spanned by $n$ points in $R^{d}$ . For any fixed $d \geq 2 k \geq 6$ , we dete…

math.CO2026

Chromatic Ramsey numbers and two-color TurÃ¡n densities

Maria Axenovich, Simon Gaa, Dingyuan Liu

Given a graph $G$ , its $2$ -color TurÃ¡n number $ex^{(2)} (n, G)$ is the maximum number of edges in an $n$ -vertex graph, such that the edges can be colored with two colors av…

math.CO2026

On the Ramsey classes of random hypergraphs

Dingyuan Liu

Let $r, s, t \geq 2$ be integers. For $r$ -graphs $G$ and $F_{1}, \dots, F_{s}$ , we write $G \to (F_{1}, \dots, F_{s})$ if every $s$ -edge-coloring of $G$ yields a monochromatic copy of $F_{i}$ in the $…

math.CO2026

A note on the mutual-visibility coloring of hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if for any two vertices $u, v \in M$ there exists a shortest $u$ - $v$ path in $G$ that contains no elements of $M$ …

math.CO2026

Visibility in hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $M$ ``see'' each other in $G$ , that is, there exists a shortest $u, v$ -path in…

math.CO2026

Dingyuan Liu

Given a graph $G$ and a real $ε > 0$ , an edge-coloring of $G$ is called $ε$ -balanced if each color appears on at least an $ε$ -fraction of the edges in $…

The number of regular simplices in higher dimensions

Chromatic Ramsey numbers and two-color TurÃ¡n densities

On the Ramsey classes of random hypergraphs

A note on the mutual-visibility coloring of hypercubes

Visibility in hypercubes

Remarks on a theorem of ErdÅs and SzemerÃ©di

Remarks on a theorem of ErdÅs and SzemerÃ©di