activity
20192026
most citedRealizing an m-uniform four-chromatic hypergraph with disks

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

collaborators

5 papers

math.CO2026

Geometric Realizations with Strong Self-Duality Part II: Diameter Graphs, Reuleaux Polyhedra, and Thrackles

Gábor Damásdi

In this paper we construct new examples of diameter graphs and Reuleaux polyhedra in , obtaining a full characterization of their combinatorial structure. For a finit…

math.CO2026

Geometric Realizations with Strong Self-Duality Part I: Non-Bipartite Quadrangulations of the Projective Plane and Strongly Involutive Self-Dual Graphs

Gábor Damásdi

In this series of articles, we study two graph classes and their various geometric representations. The first class consists of strongly involutive self-dual graphs (SISD graphs);…

math.MG2026

Many Antipodal Pairs Force Many Neighboring Pairs

Gábor Damásdi, Laurentiu Ploscaru

Let be a finite set of points of diameter at most . It is natural to expect that if many pairs lie at distance close to …

math.CO2020★ 1 cited

Realizing an m-uniform four-chromatic hypergraph with disks

Gábor Damásdi, Pálvölgyi Dömötör

We prove that for every there is a finite point set in the plane such that no matter how is three-colored, there is always a disk containing exactly…

math.CO2019

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona +8

Suppose that the vertices of a graph are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it…