Packing Arborescences in Random Digraphs

DOI10.1137/17M1151511zbMath1406.05094OpenAlexW2918954882WikidataQ116780551 ScholiaQ116780551MaRDI QIDQ4627483

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

Publication date: 11 March 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1151511

zbMATH Keywords

extremal combinatoricsarborescencerandom digraphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two Hamilton cycle problems in random graphs
• Robust Hamiltonicity of random directed graphs
• 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
• The Evolution of Random Graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Counting Hamilton cycles in sparse random directed graphs
• Arboricity and spanning‐tree packing in random graphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Edge-disjoint Hamilton cycles in random graphs
• Packing and counting arbitrary Hamilton cycles in random digraphs