The largest common subtree of two random trees

MaRDI QIDQ7210956arXivFDO

Authors Omer Angel, Caelan Atamanchuk, Serte Donderwinkel, Robin Khanfir

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

arXiv classification

math.PR

This page was built for publication: The largest common subtree of two random trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7210956)