The question of the collapsibility of random 3-regular graphs

DOI10.1016/S0012-365X(00)00084-4MaRDI QIDQ5931422zbMATH OpenFDO

Authors J. J. Spencer

Publication date 10 October 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00084-4

zbMATH Keywords

collapsibilityrandom cubic graphsrandom regular graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20)

Review text

Collapsibility of random regular graphs is reviewed and two results are given that might be useful for the open question of collapsibility of cubic graphs.

Recommendations

• Collapsibility of random clique complexes
• r 3: Resilient Random Regular Graphs
• The generalized 3-connectivity of random graphs
• On the minimum bisection of random 3-regular graphs
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences
• The threshold for d-collapsibility in random complexes
• On the triangle space of a random graph
• Geometry of the minimal spanning tree of a random 3-regular graph
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• The isoperimetric number of random regular graphs

This page was built for publication: The question of the collapsibility of random 3-regular graphs

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