most citedCombinatorial properties of continuous graphs: A survey of challenges, solutions and open problems

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

collaborators
Showing math.PRShow all

1 paper · 1 filter

math.PR2026

Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs

Dávid Ferenczi, Alexander Grigoriev

Finding large lattice subgraphs in sparse Erdős--Rényi random graphs is a classical problem at the interface of random graph theory and algorithms. General bounded-degree embedding…