Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-6pznq Total loading time: 0.257 Render date: 2021-03-06T00:01:57.342Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Large complete minors in random subgraphs

Published online by Cambridge University Press:  03 December 2020

Joshua Erde
Affiliation:
Institute of Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria
Mihyun Kang
Affiliation:
Institute of Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria
Michael Krivelevich
Affiliation:
School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 6997801, Israel
Corresponding
E-mail address:

Abstract

Let G be a graph of minimum degree at least k and let Gp be the random subgraph of G obtained by keeping each edge independently with probability p. We are interested in the size of the largest complete minor that Gp contains when p = (1 + ε)/k with ε > 0. We show that with high probability Gp contains a complete minor of order $\tilde{\Omega}(\sqrt{k})$ , where the ~ hides a polylogarithmic factor. Furthermore, in the case where the order of G is also bounded above by a constant multiple of k, we show that this polylogarithmic term can be removed, giving a tight bound.

MSC classification

Type
Paper
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.

Footnotes

Supported by the Austrian Science Fund (FWF): I3747.

Supported in part by USA–Israel BSF grant 2018267, and by ISF grant 1261/17.

References

Bollobás, B. (2001) Random Graphs, Vol. 73 of Cambridge Studies in Advanced Mathematics, second edition. Cambridge University Press.Google Scholar
Ehard, S. and Joos, F. (2018) Paths and cycles in random subgraphs of graphs with large minimum degree. Electron. J. Combin. 25 231.Google Scholar
Fountoulakis, N., Kühn, D. and Osthus, D. (2008) The order of the largest complete minor in a random graph. Random Struct. Alg. 33 127141.Google Scholar
Frieze, A. and Karoński, M. (2016) Introduction to Random Graphs. Cambridge University Press.Google Scholar
Frieze, A. and Krivelevich, M. (2013) On the non-planarity of a random subgraph. Combin. Probab. Comput. 22 722732.Google Scholar
Gilbert, E. N. (1959) Random graphs. Ann. Math. Statist. 30 11411144.Google Scholar
Glebov, R., Naves, H. and Sudakov, B. (2017) The threshold probability for long cycles. Combin. Probab. Comput. 26 208247.Google Scholar
Hoeffding, W. (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301) 1330.Google Scholar
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience.Google Scholar
Kawarabayashi, K. and Reed, B. (2010) A separator theorem in minor-closed classes. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 153162. IEEE.Google Scholar
Kostochka, A. V. (1982) The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskretnogo Analiza 38 3758.Google Scholar
Kostochka, A. V. (1984) Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4 307316.Google Scholar
Krivelevich, M. (2018) Finding and using expanders in locally sparse graphs. SIAM J. Discrete Math. 32 611623.Google Scholar
Krivelevich, M. (2019) Expanders: how to find them, and what to find in them. In Surveys in Combinatorics 2019, Vol. 456 of London Mathematical Society Lecture Note Series, pp. 115142. Cambridge University Press.Google Scholar
Krivelevich, M., Lee, C. and Sudakov, B. (2015) Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46 320345.Google Scholar
Krivelevich, M. and Nachmias, A. (2006) Coloring complete bipartite graphs from random lists. Random Struct. Algorithms 29 436449.Google Scholar
Krivelevich, M. and Samotij, W. (2014) Long paths and cycles in random subgraphs of $\mathcal{H}$ -free graphs. Electron. J. Combin 21 130.Google Scholar
Krivelevich, M. and Sudakov, B. (2013) The phase transition in random graphs: a simple proof. Random Struct. Algorithms 43 131138.Google Scholar
Riordan, O. (2014) Long cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 45 764767.Google Scholar
Thomason, A. (1984) An extremal function for contractions of graphs. Math. Proc. Camb. Phil. Soc. 95 261265.Google Scholar
Thomason, A. (2001) The extremal function for complete minors. J. Combin. Theory Ser. B 81 318338.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 7 *
View data table for this chart

* Views captured on Cambridge Core between 03rd December 2020 - 6th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Large complete minors in random subgraphs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Large complete minors in random subgraphs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Large complete minors in random subgraphs
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *