most citedAn algorithm for uniform generation of unlabeled trees (Pólya trees), with an extension of Cayley's formula

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.GTShow all

1 paper · 1 filter

math.GT2026

Finite Chains of Two-Complexes and Acyclic Covers

Laurent Bartholdi, Roman Mikhailov

A negative answer to Whitehead's asphericity problem would follow from an infinite chain of two-complexes, starting with a non-aspherical one, in which every inclusion induces the…