Complete minors in graphs without sparse cuts
From MaRDI portal
Publication:6310750
DOI10.1093/imrn/rnz086arXiv1812.01961WikidataQ128080653 ScholiaQ128080653MaRDI QIDQ6310750
Rajko Nenadov, Michael Krivelevich
Publication date: 5 December 2018
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph minors (05C83)
This page was built for publication: Complete minors in graphs without sparse cuts