Approximate Itai-Zehavi conjecture for random graphs

DOI10.1002/RSA.70095MaRDI QIDQ7397079zbMATH OpenFDO

Authors Lawrence Hollom, Lyuben Lichev, Adva Mond, Julien Portier, Yi-Ting Wang

Publication date 2026

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.70095

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial probability (60C05)

Cites work

• A new perspective on vertex connectivity
• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
• Automorphisms of random graphs with specified vertices
• Couplings and matchings: combinatorial notes on Strassen's theorem
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Hamiltonian cycles in Dirac graphs
• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• scientific article; zbMATH DE number 3683631 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 747040 (Why is no real title available?)
• scientific article; zbMATH DE number 863470 (Why is no real title available?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Optimal packings of Hamilton cycles in sparse random graphs
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Random graphs.
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Random regular graphs of high degree
• Sandwiching dense random regular graphs between binomial random graphs
• Sandwiching random regular graphs between binomial random graphs
• Sprinkling with random regular graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The asymptotic connectivity of labelled regular graphs
• The diameter of random regular graphs
• The multi-tree approach to reliability in distributed networks
• Three tree-paths
• Tight Bounds on Vertex Connectivity Under Sampling
• Triangles and subgraph probabilities in random regular graphs

This page was built for publication: Approximate Itai-Zehavi conjecture for random graphs

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