Packing arborescences in random digraphs

DOI10.1016/j.endm.2017.07.015zbMath1379.05101arXiv1605.05764OpenAlexW2963361467MaRDI QIDQ1689982

Cristiane M. Sato, Carlos Hoppen, Roberto F. Parente

Publication date: 18 January 2018

Full work available at URL: https://arxiv.org/abs/1605.05764

zbMATH Keywords

spanning treerandom graphrandom digraphedge disjoint spanning treepacking arborescence

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Hamilton decompositions of regular expanders: applications
• Combinatorial Optimization
• Rainbow Arborescence in Random Digraphs
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Edge-disjoint Hamilton cycles in random graphs
• Robust hamiltonicity of random directed graphs extended abstract
• Arboricity and spanning-tree packing in random graphs with an application to load balancing

This page was built for publication: Packing arborescences in random digraphs