D. Ismailescu

activity

20092023

R^{n}

for Small Values of

n

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

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 3 cited

The chromatic number of the Minkowski plane -- the regular polygon case

Geoffrey Exoo, David Fisher, Dan Ismailescu

The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance…

math.CO2021

On the maximum area of inscribed polygons

Dan Ismailescu, Min Jung Kim, Eric Wang

Given a convex $n$ -gon $P$ and a positive integer $m$ such that $3 \leq m \leq n - 1$ , let $Q$ denote the largest area convex $m$ -gon contained in $P$ . We are interested in the minimum v…