= Dömötör Pálvölgyi
{c}
<Dömötör Pálvölgyi> studies <combinatorics> and <discrete geometry>, particularly colorings of geometric <hypergraphs>. His ELTE research statement identifies covering decomposition as a motivating problem.https://ttk.wwwtest.elte.hu/en/staff/domotor-andras-palvolgyi[Institutional identity and first-person research statement]{ref}
A typical question asks whether a sufficiently deep multiple covering of the plane by unit disks can be split into two coverings. Coloring the disks with two colors reformulates the goal: every point must lie in a disk of each color. This connects geometric coverage with a hypergraph-coloring constraint, translating a continuous geometric problem into combinatorial structure.https://ttk.wwwtest.elte.hu/en/staff/domotor-andras-palvolgyi[Research description: decompositions of multiple disk coverings]{ref}
Back to article page
