Skip to content

Author

Dávid Ferenczi

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Local Search for Almost-Spanning Square Grids in Erd\H{o}s--R\'enyi Random Graphs

Finding large lattice subgraphs in sparse Erd\H{o}s--R\'enyi random graphs is a classical problem at the interface of random graph theory and algorithms. General bounded-degree embedding and universality theorems give powerful results for broad graph families, but when specialized to square grids they operate at densit...

Dávid Ferenczi, Alexander Grigoriev · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.