A note on the width of sparse random graphs

DOI10.1002/JGT.23081MaRDI QIDQ6494006zbMATH OpenFDO

Authors Tuan Anh Do, Joshua Erde, Mihyun Kang

Publication date 29 April 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23081

zbMATH Keywords

graph expansionrandom graphrank-widthtree-width

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Rank-width of random graphs
• On the tree-depth of random graphs
• scientific article; zbMATH DE number 845729
• Twin-width of random graphs
• A note on treewidth in random graphs

Cited in

(3)

• Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
• The emergence of a giant rainbow component
• Tangled paths: a random graph model from Mallows permutations

This page was built for publication: A note on the width of sparse random graphs

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