3 papers
math.CO2026
On the range of two-distance graphs
Péter Ágoston
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some it can be mapped into…
math.CO2025
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For a positive integer and an ordered set of points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into eq…
math.CO2024
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to it…