Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Gehér, Panna"'
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are looking for an
Externí odkaz:
http://arxiv.org/abs/2404.11454
The diameter of a directed graph is a fundamental parameter defined as the maximum distance realized among the pairs of vertices. As graphs of small diameter are of interest in many applications, we study the following problem: for a given directed g
Externí odkaz:
http://arxiv.org/abs/2402.06259
Autor:
Gehér, Panna, Tóth, Géza
A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n - 3}\rfloor$ edges.
Externí odkaz:
http://arxiv.org/abs/2310.00940
Publikováno v:
Discrete & Computational Geometry (2024)
We prove that for any $\ell_p$-norm in the plane with $1
Externí odkaz:
http://arxiv.org/abs/2308.08840
Autor:
Gehér, Panna
The famous Hadwiger-Nelson problem asks for the minimum number of colors needed to color the points of the Euclidean plane so that no two points unit distance apart are assigned the same color. In this note we consider a variant of the problem in Min
Externí odkaz:
http://arxiv.org/abs/2301.13695
Autor:
Frankl, Nóra1,2 (AUTHOR), Gehér, Panna2,3 (AUTHOR) geher.panna@ttk.elte.hu, Sagdeev, Arsenii2,4 (AUTHOR), Tóth, Géza (AUTHOR)
Publikováno v:
Discrete & Computational Geometry. Nov2024, p1-15.
