29 citations · 92 across the 53 of their papers we have counts for
69 papers
A cyclic non-Ramsey heptagon
Dömötör Pálvölgyi
We present a construction with seven points on a circle that is not Ramsey, disproving a conjecture of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus.
A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations
Dömötör Pálvölgyi
Let P be a finite spherical set. We prove that if P admits a solvable group of isometries acting transitively on it, then every r-coloring of a sufficiently high-dimensional sphere…
Note on polychromatic coloring of hereditary hypergraph families II
Dömötör Pálvölgyi
We extend a recent construction concerning polychromatic colorings of hereditary hypergraph families. For every integer we construct a -uniform hypergraph which ha…
Coloring Geometric Hypergraphs: A Survey
Gábor Damásdi, Balázs Keszegh, János Pach +2
The \emph{chromatic number} of a hypergraph is the smallest number of colors needed to color the vertices such that no edge of at least two vertices is monochromatic. Given a famil…
Erdős-Szekeres Maker-Breaker Games
Aleksa Džuklevski, Dömötör Pálvölgyi, Alexey Pokrovskiy +3
We present new results on Maker-Breaker games arising from the Erdős-Szekeres problem in planar geometry. This classical problem asks how large a set in general position has to be…
The complexity of recognizing -free hypergraphs
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi +1
The study of geometric hypergraphs gave rise to the notion of -free hypergraphs. A hypergraph is called -free if there is an ordering of its vertices such…