Large induced trees in sparse random graphs

From MaRDI portal





Random graphs, random regular graphs, and random regular digraphs where the average degree is constant are shown to have spanning trees almost surely.











This page was built for publication: Large induced trees in sparse random graphs

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