Packing paths in sparse random graphs

DOI10.1002/RSA.70022MaRDI QIDQ6936350zbMATH OpenFDO

Authors Vesna Iršič Chenoweth, Julien Portier, Leo Versteegen

Publication date 29 August 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.70022

zbMATH Keywords

adaptive algorithmspath packingrandom graphsrandom trees

Mathematics Subject Classification ID

Trees (05C05) Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Packing paths in sparse random graphs

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