Large complete minors in random subgraphs

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.

[1]  W. Samotij,et al.  Long paths and cycles in random subgraphs of H-free graphs , 2013, 1303.1066.

[2]  Benny Sudakov,et al.  The phase transition in random graphs: A simple proof , 2012, Random Struct. Algorithms.

[3]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[4]  Alexandr V. Kostochka,et al.  Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..

[5]  Michael Krivelevich,et al.  Finding and Using Expanders in Locally Sparse Graphs , 2017, SIAM J. Discret. Math..

[6]  A. Kostochka.  The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .

[7]  Bruce A. Reed,et al.  Colouring graphs when the number of colours is almost the maximum degree , 2014, J. Comb. Theory, Ser. B.

[8]  Alan M. Frieze,et al.  On the Non-Planarity of a Random Subgraph , 2012, Combinatorics, Probability and Computing.

[9]  Bruce A. Reed,et al.  A Separator Theorem in Minor-Closed Classes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[10]  A. Frieze,et al.  Introduction to Random Graphs , 2016 .

[11]  Andrew Thomason,et al.  The Extremal Function for Complete Minors , 2001, J. Comb. Theory B.

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  Wojciech Samotij,et al.  Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs , 2014, Electron. J. Comb..

[14]  Benny Sudakov,et al.  The Threshold Probability for Long Cycles , 2014, Combinatorics, Probability and Computing.

[15]  Stefan Ehard,et al.  Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree , 2018, Electron. J. Comb..

[16]  A. Thomason.  An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[17]  Benny Sudakov,et al.  Long paths and cycles in random subgraphs of graphs with large minimum degree , 2012, Random Struct. Algorithms.

[18]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[19]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[20]  Daniela Kühn,et al.  The order of the largest complete minor in a random graph , 2007, Random Struct. Algorithms.

[21]  Oliver Riordan.  Long cycles in random subgraphs of graphs with large minimum degree , 2014, Random Struct. Algorithms.

[22]  M. Krivelevich,et al.  Expanders - how to find them, and what to find in them , 2018, BCC.

[23]  Michael Krivelevich,et al.  Coloring complete bipartite graphs from random lists , 2006, Random Struct. Algorithms.