Cycles and clique-minors in expanders

Transcription

1 Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University

2 Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor in X }. Definition: Graph G on n vertices is an expander if X G of order at most n/2, X X is large (at least constant). G is locally expander if X X is large X G up to a certain size. Applications: Communication networks, Derandomization, Metric embeddings, Computational complexity, Coding theory, Markov chains,...

5 Cycle lengths Definition: cir(g) = circumference of graph G is the length of the longest cycle in G. C(G) = set of cycle lengths in G, i.e., all l such that C l G. Typical questions: How large is the circumference of G? How many different cycle lengths are in G? What are the arithmetic properties of C(G), e.g., is there a cycle in G whose length is a power of 2? Toy example: If G has minimum degree d then cir(g) d and C(G) d 1.

7 Many cycle lengths Conjecture: (Erdős 1992 ) If graph G has average degree d and girth 2k + 1, then C(G) Ω(d k ). Remarks: Tight for k = 2, 3, 5, and probably for all k. It is believed that for every fixed k there are graphs of order O(d k ) with minimum degree d and girth 2k + 1. True for k = 2 by Erdős, Faudree, Rousseau, and Schelp. Problem: (Erdős ) If G has large (but constant) average degree, does it contain a cycle of length 2 i for some i > 0?

8 New results Theorem: (S.- Verstraëte ) Let G be a graph with average degree d. If G is C 2k -free then C(G) Ω(d k ). ( If G is K s,t -free then C(G) Ω d s/(s 1) ). Moreover, C(G) contains an interval of consecutive even integers of this length. Theorem: (S.- Verstraëte ) If graph G on n vertices has average degree at least e c log n then G contains a cycle of length 2 i for some i > 0. (True for any exponentially growing sequence of even numbers)

9 Expansion and long path Lemma: (Pósa 1976 ) If every subset X G of size X m has X > 2 X then G contains a path of length 3m. Corollary: If G has average degree d and no cycle of length 2k then it contains a path of length Ω(d k ).

10 Existence of long cycle Let G be a connected, bipartite graph with average degree d and no cycle of length 2k. Fix any v G and let L i be all the vertices in G within distance i from v. Note that e(li, L i+1 ) = e(g) = d 2 G = d 2 Li d ( 4 Li + L i+1 ). Therefore one of the induced subgraphs G[L i, L i+1 ] has average degree at least d/2. It has a path of length Ω(d k ) between L i and L i+1, which together with v gives a long cycle.

11 Graph minors Definition: Graph Γ is a minor of graph G if for every vertex u Γ there is a connected subgraph G u G such that G u and G u are vertex disjoint for all u u. For every edge (u, u ) of Γ there is an edge from G u to G u.

12 Clique minors Question: Find sufficient condition for graph G to contain given Γ as a minor. (e.g., when Γ is a clique) Conjecture: (Hadwiger 1943) Every graph with chromatic number at least k contains a clique on k vertices as a minor. Remark: Every graph with chromatic number k contains a subgraph with minimum degree k 1. Theorem: (Kostochka, Thomason 80 s) Every graph with average degree d contains a clique-minor of order d c log d.

13 Minors in graphs of large girth Theorem: (Thomassen, Diestel-Rompel, Kühn-Osthus) If G has girth 2k + 1 and average degree d, then it contains a minor with average degree Ω ( ) d k+1 2. Observation: Any minor of graph G has at most e(g) edges and therefore has average degree at most 2e(G). Remark: Graphs of order O(d k ), with minimum degree d and girth 2k + 1, have O(d k+1 ) edges, so they cannot have minors with average degree d k+1 2. Question: Do we need the girth assumption? Is it enough to forbid cycle C 2k?

15 New results Theorem: (Krivelevich-S.) Let G be a graph with average degree d. If G is C 2k -free then it contains a minor with average degree Ω ( d k+1 2 If G is K s,t -free then it contains a minor with average degree ). Ω ( d 1+ 2(s 1)) 1. Remark: The same approach is used to prove both statements. One of its key ingredients is the expansion property of H-free graphs.

16 Minors in expanders Definition: A separator of a graph G of order n is a set of vertices whose removal separates G into connected components of size 2n/3. Theorem: (Plotkin-Rao-Smith, improving on Alon-Seymour-Thomas) If an n-vertex graph G has no clique-minor on h vertices, then it has a separator of order O ( h n log n ). Corollary: (Plotkin-Rao-Smith, Kleinberg-Rubinfeld) Let G be a graph on n vertices and let t > 0 be a constant. If all subsets X G of size at most n/2( have X ) t X then G contains a clique-minor of order Ω n log n.

17 Superconstant expansion Question: What size clique-minors can one find in a graph G on n vertices, whose expansion factor t together with n? Remarks: Proof based on separators can t give bound better than n log n since every graph of order n has separator of size n/3. Random graph G(n, t/n) has almost surely expansion factor t and clique-minor of order Ω ( nt log n). (Bollobás-Erdős-Catlin, improved by Fountoulakis-Kühn-Osthus) Question: What if edges of G are distributed like in the random graph?

19 New result: expanders Theorem: (Krivelevich-S.) If all subsets X G of size X O(n/t) have X t X then G contains a minor with average degree ( ) Ω nt log t log n. Remarks: For t = n ɛ this gives a minor with average degree Ω( nt) and thus also a clique-minor of order Ω( nt/ log n). The random graph G(n, t/n) shows that this bound is tight. If G is a C 4 -free graph of order n = O(d 2 ), then for t = d/3 every subset of G of size O(n/t) expands by factor of t. Thus G has a minor with average degree Ω( nt) = Ω(d 3/2 )

20 New result: pseudo-random graphs Definition: A graph G is (p, β)-jumbled if for every subset of vertices X e(x ) p X 2 /2 β X. Theorem: (Krivelevich-S.) Every (p, β)-jumbled graph G on n vertices with β = o(np) contains a minor with average degree Ω(n p). Remarks: This is tight since such a graph G has O(n 2 p) edges. It extends results of Thomason and Drier-Linial. Expansion factor of (p, β)-jumbled G can be only np β np. If G is an (n, d, λ)-graph then it is (d/n, λ)-jumbled. Hence if λ = o(d) it has a minor with average degree Ω( nd).

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

68 Part II. Combinatorial Models can require a number of spin flips that is exponential in N (A. Haken et al. ca. 1989), and that one can in fact embed arbitrary computations in the dynamics (Orponen 1995).

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

A threshold for the Maker-Breaker clique game Tobias Müller Miloš Stojaković October 7, 01 Abstract We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p. In this game,

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

Classification: Physical Sciences, Mathematics The average distances in random graphs with given expected degrees by Fan Chung 1 and Linyuan Lu Department of Mathematics University of California at San

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify

A DIRAC TYPE RESULT ON HAMILTON CYCLES IN ORIENTED GRAPHS LUKE KELLY, DANIELA KÜHN AND DERYK OSTHUS Abstract. We show that for each α > every sufficiently large oriented graph G with δ + (G), δ (G) 3 G

Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:

Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree Suil O, Douglas B. West November 9, 2008; revised June 2, 2009 Abstract A balloon in a graph G is a maximal 2-edge-connected

5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

Game Chromatic Index of Graphs with Given Restrictions on Degrees Andrew Beveridge Department of Mathematics and Computer Science Macalester College St. Paul, MN 55105 Tom Bohman, Alan Frieze, and Oleg

To ensure the functioning of the site, we use cookies. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy &amp Terms.
Your consent to our cookies if you continue to use this website.