Showing 2023Show all
2 papers · 1 filter
math.CO2023
Block partitions in higher dimensions
Endre Csóka
Consider a set which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in in …
math.CO2023
Finding cliques and dense subgraphs using edge queries
Endre Csóka, András Pongrácz
We consider the problem of finding a large clique in an Erdős--Rényi random graph where we are allowed unbounded computational time but can only query a limited number of edges. Re…