Dingyuan Liu

activity

20242026

most citedVisibility in hypercubes

1 citations · 1 across the 14 of their papers we have counts for

collaborators

Showing 2024Show all

6 papers · 1 filter

math.CO2024

Subset selection problems in planar point sets

József Balogh, Felix Christian Clemen, Adrian Dumitrescu +1

Given a finite point set satisfying condition $A$ , the subset selection problem asks, how large of a subset satisfying condition $B$ can be extracted? In this p…

math.CO2024

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.CO2024

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

math.CO2024

On the number of sets with small sumset

Dingyuan Liu, Letícia Mattos, Tibor Szabó

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$ -element subset $Y \subseteq G$ we show that if $m ≪ s^{2} / (lo g n)^{2}$ , the…

math.CO2024

Induced saturation for complete bipartite posets

Dingyuan Liu

Given $s, t \in N$ , a complete bipartite poset $K_{s, t}$ is a poset whose Hasse diagram consists of $s$ pairwise incomparable vertices in the upper layer and $t$ pa…

math.CO2024★ 1 cited

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…