Long Cycles in Locally Expanding Graphs, with Applications

We provide sufficient conditions for the existence of long cycles in locally expanding graphs, and present applications of our conditions and techniques to Ramsey theory, random graphs and positional games.

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

[2]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

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

[4]  Benny Sudakov,et al.  The size Ramsey number of a directed path , 2010, Journal of combinatorial theory. Series B (Print).

[5]  Vijaya Ramachandran,et al.  The k-orientability thresholds for Gn, p , 2007, SODA '07.

[6]  Andrzej Dudek,et al.  An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths , 2015, Comb. Probab. Comput..

[7]  Michael Krivelevich,et al.  Waiter-Client and Client-Waiter Hamiltonicity games on random graphs , 2015, Eur. J. Comb..

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

[9]  Penny E. Haxell.  Tree embeddings , 2001, J. Graph Theory.

[10]  Yoshiharu Kohayakawa,et al.  The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.

[11]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[12]  Colin McDiarmid,et al.  Random Graphs, Geometry and Asymptotic Structure , 2016, London Mathematical Society student texts.

[13]  Michael Krivelevich,et al.  Manipulative Waiters with Probabilistic Intuition , 2014, Combinatorics, Probability and Computing.

[14]  Zoltán Füredi,et al.  Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..

[15]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[16]  Oren Dean,et al.  Client-Waiter Games on Complete and Random Graphs , 2016, Electron. J. Comb..

[17]  J. Beck.  Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[18]  Andrzej Dudek,et al.  On some Multicolor Ramsey Properties of Random Graphs , 2016, SIAM J. Discret. Math..

[19]  P. Dembowski.  Finite geometries , 1997 .

[20]  Noga Alon,et al.  Long cycles in critical graphs , 2000 .

[21]  Michael Krivelevich,et al.  Positional Games , 2014, 1404.2731.

[22]  Angelika Steger,et al.  Coloring the edges of a random graph without a monochromatic giant component , 2009, Electron. Notes Discret. Math..

[23]  Michael Krivelevich,et al.  Waiter-Client and Client-Waiter planarity, colorability and minor games , 2014, Discret. Math..

[24]  Shoham Letzter.  Path Ramsey Number for Random Graphs , 2016, Comb. Probab. Comput..

[25]  Wojciech Samotij,et al.  Large Bounded Degree Trees in Expanding Graphs , 2010, Electron. J. Comb..

[26]  Joel Friedman,et al.  Expanding graphs contain all small trees , 1987, Comb..

[27]  B. Sudakov,et al.  Pseudo-random Graphs , 2005, math/0503745.

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

[29]  János Komlós,et al.  The longest path in a random graph , 1981, Comb..

[30]  Peter Sanders,et al.  The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation , 2007, SODA '07.

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

[32]  Alan M. Frieze,et al.  Ramsey games with giants , 2009, Random Struct. Algorithms.

[33]  Alexey Pokrovskiy.  Partitioning edge-coloured complete graphs into monochromatic cycles and paths , 2014, J. Comb. Theory, Ser. B.

[34]  Reinhard Diestel,et al.  Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs , 2006, Comb..

[35]  Oleg Pikhurko,et al.  Biased positional games on matroids , 2005, Eur. J. Comb..

[36]  Naomi Gall,et al.  On' n 'on , 2008 .

[37]  Benny Sudakov,et al.  Long cycles in subgraphs of (pseudo)random directed graphs , 2010, J. Graph Theory.

[38]  Tomasz Luczak,et al.  Biased positional games and the phase transition , 2001, Random Struct. Algorithms.

[39]  Oleg Pikhurko,et al.  Odd and even cycles in Maker-Breaker games , 2008, Eur. J. Comb..

[40]  József Beck,et al.  On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.

[41]  Malgorzata Bednarska-Bzdega.  On weight function methods in Chooser-Picker games , 2013, Theor. Comput. Sci..

[42]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .