2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
A lower bound on the number of colours needed to nicely colour a sphere
Péter Ágoston
The Hadwiger--Nelson problem is about determining the chromatic number of the plane (CNP), defined as the minimum number of colours needed to colour the plane so that no two points…
Orientation of good covers
Péter Ágoston, Gábor Damásdi, Balázs Keszegh +1
We study systems of orientations on triples that satisfy the following so-called interiority condition: impl…
Orientation of convex sets
Péter Ágoston, Gábor Damásdi, Balázs Keszegh +1
We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to othe…
Probabilistic formulation of the Hadwiger--Nelson problem
Péter Ágoston
This is a slightly modified version of my MSc thesis from 2019. Supervisor was Dömötör Pálvölgyi.
An improved constant factor for the unit distance problem
Péter Ágoston, Dömötör Pálvölgyi
We prove that the number of unit distances among planar points is at most , improving on the previous best bound of . We also give better upper and…