THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION
|
|
- Lucinda Horn
- 5 years ago
- Views:
Transcription
1 THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION YAQIAO LI In this note we will prove Szemerédi s regularity lemma, and its application in proving the triangle removal lemma and the Roth s theorem on 3AP. 1. The Regularity Lemma Consider a bipartite graph given by vertex sets A, B, let E(A, B) be the set of edges between them, we define the density of this bipartite graph (A, B) as d(a, B) := E(A, B). A B Definition 1 (ɛ-regular). Say the bipartite graph (A, B) is ɛ-regular if for any A A, B B with A ɛ A and B ɛ B, we have d(a, B ) d(a, B) ɛ. Intuitively, this definition of regularity can be understood as the bipartite graph given by A, B is random looking, or that the edges are uniformly distributed. Let s continue. We say a partition is equipartition if the number of elements in different parts differ by at most one. Definition 2 (ɛ-regular equipartition). Say an equipartition (of V (G), say) given by V 1,..., V k is ɛ-regular if all but at most ɛk 2 of the pairs (V i, V j ) are ɛ-regular. That is, most pairs of this partition give random looking bipartite graphs, with just a tiny fraction of irregular parts. Alert! Although, that different pairs can have very different edge densities (as bipartite graphs). The Szemerédi s regularity lemma guarantees the existence of regular equipartition of arbitrary graphs. Theorem 1 (Szemerédi s regularity). For every ɛ > 0, there exists T (ɛ) > 0 (which depends on ɛ only, not depend on specific graphs) such that every graph G has an ɛ-regular equipartition into k parts, where the bounds of k is given as follows The upper bound T (ɛ) is a tower of 2. 1 ɛ k T (ɛ). 2. Application: The Triangle Removal Lemma We will use this regularity lemma to prove the triangle removal lemma. Theorem 2 (Triangle removal lemma). For every ɛ > 0, there exists δ = δ(ɛ) > 0 such that if G is ɛ-far from being triangle free (that is, we have to remove at least ɛn 2 edges to make G triangle free), then G contains at least δn 3 triangles, where n is the number of vertices of G. Date: April, McGill University, yaqiao.li@mail.mcgill.ca. 1
2 2 YAQIAO LI If a graph contains Ω(n 3 ) triangles, we then have to remove Ω(n 2 ) edges to make it triangle free since deleting one edge can remove at most n 2 triangles. This lemma says the converse: if G contains o(n 3 ) triangles, then it can be made triangle free by deleting o(n 2 ) edges. We need the following lemma to prove this theorem. Lemma 1. For any tri-partite graph given by vertex sets A, B, C such that d(a, B) = b, d(a, C) = c, d(b, C) = a, and a 2ɛ, b 2ɛ, c 2ɛ, if all these three pairs (A, B), (A, C) and (B, C) are ɛ-regular, then the number of triangles in this tri-partite graph is at least (1 2ɛ)(a ɛ)(b ɛ)(c ɛ) A B C. This lemma says that if a tri-partite graph is pairwise dense and regular, then it contains a positive portion of triangles (i.e., a lot of triangles). Proof. Let us consider those vertices in A having small neighbourhood in B, S := {v A : N B (v) < (b ɛ) B } A, where N B (v) denotes the set of neighbours of v in B. We will show the set S is very small, specifically we claim S < ɛ A. Assume otherwise, then for the pair (S, B), we have that S ɛ A and B ɛ B, since (A, B) is ɛ-regular, we have d(s, B) d(a, B) = d(s, B) b ɛ. But E(S, B) S (b ɛ) B d(s, B) = < = b ɛ, S B S B contradicting to the preceding inequality. Hence we have the size S is small as claimed. Similarly, we have the set T := {v A : N C (v) < (c ɛ) C }, is also small, where N C (v) denotes the set of neighbours of v in C. Specifically, we have T < ɛ A. Now let us look at the remaining vertices of A, that is the set then we know the set A is large, specifically, A := A S T, A (1 2ɛ) A. By our choice of S and T, we know that every vertex v A has big neighbours both in B and in C, N B (v) (b ɛ) B }, N C (v) (c ɛ) C, v A. It follows by the fact that the pair (B, C) is ɛ-regular that In particular we have implying that d(n B (v), N C (v)) d(b, C) = d(n B (v), N C (v)) a ɛ, v A. d(n B (v), N C (v)) a ɛ, E(N B (v), N C (v)) (a ɛ) N B (v) N C (v) (a ɛ)(b ɛ)(c ɛ) B C.
3 THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION 3 Observe that E(N B (v), N C (v)) is exactly the number of triangles lying in ({v}, N B (v), N C (v)). Hence #triangles in (A, B, C) #triangles in (A, B, C) ((1 2ɛ) A ) ((a ɛ)(b ɛ)(c ɛ) B C ). Now we prove the triangle removal lemma. The idea is to first use regularity lemma to give a regular equipartition, then appropriately clean up the partition such that we can focus only on those dense tri-partite graphs, and then apply the preceding lemma to conclude we have a lot of triangles. Proof. Step 1: Apply regularity lemma. Let s apply regularity lemma with ɛ 4 to the graph G, then G has an ɛ 4-regular equipartition into k parts, where 4 ɛ k T ( ɛ 4 ). Say this equipartition is given by V 1,..., V k. Step 2: Clean up. Think of this equipartition as an equipartition of the adjacency matrix of G. We will clean up this partition by removing the following three bad parts: the diagonal, the irregular parts, and the sparse parts. Fortunately, these parts are small enough, so we are still left a large and dense parts to work with. Remove the diagonal. That is, to remove all edges in every V i, this will remove at most k (n/k) ɛn2 edges. Remove the irregular parts. By the definition of ɛ 4 -regular equipartition, we have at most ɛ 4 k2 irregular pairs, hence removes at most ɛ 4 k2 (n/k) ɛn2 edges. Remove the sparse parts. Since we are working with ɛ 4-regularity, in the preceding lemma we think a bipartite pair is dense if the edge density is larger than 2 ɛ 4 = ɛ 2. Hence we remove all pairs which has edge density less than ɛ 2, this will remove at most ( k ɛ 2) 2 (n/k)2 1 4 ɛn2. In total, we have removed at most 5 8 ɛn2 edges. Step 3: Apply the preceding lemma. Since G is ɛ-far from triangle free, we know that there are still triangles in G. Suppose the tri-partite graph (V i, V j, V l ) contains a triangle, then there is at least one edge between each pair, hence the edges in every pair have not been removed in step 2. It follows that i, j, l are pairwise unequal and they are pairwise regular and dense. Applying the preceding lemma, we have that (V i, V j, V l ) contains at least triangles, in which as desired. (1 2 ɛ 4 )( ɛ 2 ɛ 4 )3 (n/k) 3 δn 3, δ = (1 ɛ 2 ) ɛ T (ɛ/4) 3, Note that we have used both the lower bound and the upper bound from Szemerédi s regularity lemma to obtain a formula for δ in the triangle removal lemma. The sharp bound of δ is still an open question. 3. Application: Roth s 3AP Theorem We now use the triangle removal lemma to show Roth s theorem. Theorem 3 (Roth). For any ɛ > 0, there exists N = N(ɛ) > 0 such that for all n N, if A Z n satisfies A ɛn, then A contains a nontrivial 3AP.
4 4 YAQIAO LI Proof. We will construct a graph G and apply the triangle removal lemma. Let G be a tri-partite graph defined by vertex sets V 1 = V 2 = V 3 = Z n, so V (G) = 3n. Define edges for G as follows: For r V 1, s V 2, put (r, s) G if and only if s r A; For s V 2, t V 3, put (s, t) G if and only if t s A; For r V 1, t V 3, put (r, t) G if and only if (t r)/2 A; Consider (r, s, t) V 1 V 2 V 3 and suppose they form a triangle, by our choice of edges, this means that s r A, t s A, (t r)/2 A, hence we get (s r, t r 2, t s) is a 3AP in A. The problem is that this might be just a trivial 3AP, i.e., we may have s r = t r 2 = t s = a A, then this trivial triangle is formed by (s, s + a, s + 2a) V 1 V 2 V 3 where s Z n, a A, that is, each trivial triangle corresponds to a distinct pair (s, a) Z n A, hence different trivial triangles are disjoint. We have ɛn 2 #trivial triangles n 2. The lowerbound implies that G is ɛ 9-far away from being triangle free, by triangle removal lemma this implies that we have at least δ(3n) 3 triangles for some δ = δ(ɛ) > 0. Now use the upper bound for the trivial triangles we know that there must exist some nontrivial triangles, equivalently nontrivial 3AP in A, as long as n is sufficiently large depending on ɛ. 4. Proof of the Regularity Lemma At last, let us prove the regularity lemma. The proof is an energy argument. We will define a notion of energy associated with each partition, we will see that lack of regularity implies energy increment, but this energy is bounded above, hence the regularity must appear after a finite steps of refining (of the partition). Given a real matrix A m n = (A ij ), define its energy as E(A) := A 2 ij 0. Obversely, if the entries of A are bounded by r, then a trivial upper bound is E(A) mnr 2. In particular, if A is an n n adjacency matrix of some graph G, then E(A) n 2. i,j A ij For every matrix A m n = (A ij ), let d(a) := mn be the density of A. Construct a new matrix B m n := (B ij ) where B ij = d(a) for all 1 i m and 1 j n. This new matrix can be viewed as a smoothing of the original matrix A. Let π be an operator that maps every matrix A to its smoothing π(a) = B as just defined. Note that π(a) is a matrix with all entries being a constant, hence the smoothing operation is unique. Conversely, A can be viewed as a mixing of π(a). Note, however, that π(a) can have different mixings: for two matrices A B, it is possible that π(a) = π(b) = C as long as d(a) = d(b), hence A, B are smoothed to the same matrix C, so either A or B can be viewed as a mixed version of C. Here is a useful fact, it says that the energy decreases as we smooth a matrix, conversely, the energy increases as we mix a matrix. Lemma 2. For every matrix A m n = (A ij ), we have E(A) E(π(A)) = (A ij d(a)) 2 = E(A π(a)). In particular, we have E(π(A)) E(A). Proof. It s a direct calculation.
5 THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION 5 Let M be a partition of [m] and N be a partition of [n], for S M, T N, note that S [m], T [n], let A S T be the corresponding submatrix of A, hence M and N together define a partition of matrix A. Let us denote this partition as P M,N := (M, N ), we also denote P M,N := {A S T : S M, T N }. Let us smooth every submatrix A S T to π(a S T ), and denote this new blockwise-smoothed matrix of A to be P M,N (A). For example, in two extreme cases, we have If M = {[m]} and N = {[n]}, i.e., the matrix is not partitioned, then P M,N (A) = π(a) is just the smoothing of A; If M = {{1}, {2},..., {m}} and N = {{1}, {2},..., {n}}, i.e., the matrix is partitioned into singletons, then P M,N (A) = A since the smoothing of each singleton is just itself. Remember that given a partition P M,N = (M, N ) of matrix A, the matrix P M,N (A) is a blockwise-smoothed version of A, let its entry be denoted by p ij, i.e., P M,N (A) = (p ij ). Given another partition P M,N = (M, N ) that is a refinement of P M,N, let its entry be denoted by p ij, i.e., P M,N (A) = (p ij ). A useful generalization of the above lemma is the following. Lemma 3. For every matrix A m n = (A ij ), and any two partitions P M,N and P M,N of matrix A where P M,N is a refinement of P M,N, we have E(P M,N (A)) E(P M,N (A)) = (p ij p ij ) 2 = E(P M,N (A) P M,N (A)). In particular we have E(π(A)) E(P M,N (A)) E(P M,N (A)) E(A). Proof. Just view each block(that is, a submatrix) of P M,N as an individual matrix, then a refinement of P M,N is just a mixing of each block, then apply the previous lemma to each block. Observe also that we have π(p M,N (A)) = π(p M,N (A)) = π(a), that is, P M,N (A), P M,N (A) and A all can be viewed as different mixing versions of π(a), the difference is that they are successively refined mixing versions. Definition 3 (ɛ-regularity of a matrix). Say a matrix A m n is ɛ-regular if for any S [m], T [n] with S ɛm, T ɛn, we have d(a S T ) d(a) ɛ. The following is important. Lemma 4 (Lack of Regularity implies bounded energy increment). Suppose A m n is not ɛ- regular, then there is a partition P M,N of A such that E(P M,N (A)) E(π(A)) > mnɛ 4. Proof. As A is not ɛ-regular, there exists S [m], T [n] with S ɛm, T ɛn such that d(a S T ) d(a) > ɛ. Define a partition P M,N := (M, N ) as M = {S, [m] S} and N = {T, [n] T }. Apply lemma 3 we have E(P M,N (A)) E(π(A)) = (p ij d(a)) 2 as desired. i S,j T (p ij d(a)) 2 = > ɛ 2 S T mnɛ 4, i S,j T (d(a S T ) d(a)) 2
6 6 YAQIAO LI Definition 4 (ɛ-regular partition of a matrix). Say a partition P M,N of a matrix A m n is ɛ-regular if all except at most ɛ M N pairs (S, T ) M N satisfy that A S T is ɛ-regular. As a corollary of Lemma 4 we have the following. Lemma 5 (Lack of Regularity implies bounded energy increment-2). Suppose an equipartition P M,N of a matrix A m n is not ɛ-regular, then there is a refined equipartition P M,N such that E(P M,N (A)) E(P M,N (A)) > mnɛ 5. Proof. Assume M = k, N = l, that is, the rows and columns of A are partitioned equally into k and l parts, respectively. As P M,N is not ɛ-regular, there exist at least ɛkl pairs (S, T ) M N such that A S T are not ɛ-regular. By Lemma 4, we can partition each block A S T such that this block has energy increment > S T ɛ 4 = mn kl ɛ4. Define the refined partition P M,N of the whole matrix A to be the intersection of the partitions of each block, if it is not an equipartition, refine it appropriately to make it into an equipartition. Observe that the effect of P M,N on each block is an even finer partition than the one used to achieve bounded energy increment, by Lemma 3, the energy can only increase even more. Hence by Lemma 3 and Lemma 4 we have E(P M,N (A)) E(P M,N (A)) > (ɛkl) ( mn kl ɛ4 ) = mnɛ 5, as desired. We have seen that refine the irregular partition induces bounded energy increment, but the energy is trivially bounded above by mnr if all the entries are bounded by r, hence the refining process must terminate, meaning that the regularity of partition must be achieved after a finite number of steps. Now we can give a sketch of the proof of the regularity lemma. Proof. Let A n n be the adjacency matrix of a graph G. Start with k = 1 ɛ -equipartition of A, repeat the refinement process to achieve the regularity (of partition) in a finite number of steps, specifically, in at most n 2 /(n 2 ɛ 5 ) = 1/ɛ 5 steps. It should be noted that to apply Lemma 5, we should also take care of the size of the refinement equipartition, i.e., it cannot be too large. It can be shown that from a k-equipartition P M,N, one can take an at most 8 k -equipartition P M,N to achieve the energy increment bound in Lemma 5. Hence eventually we will reach an ɛ-regular l-equipartition where l is bounded above by a tower of the form 8 k in at most 1/ɛ 5 levels.
SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS
SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS ALEXANDER SCOTT Abstract. Szemerédi s Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of
More informationAdditive Combinatorics and Szemerédi s Regularity Lemma
Additive Combinatorics and Szemerédi s Regularity Lemma Vijay Keswani Anurag Sahay 20th April, 2015 Supervised by : Dr. Rajat Mittal 1 Contents 1 Introduction 3 2 Sum-set Estimates 4 2.1 Size of sumset
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationApproximating sparse binary matrices in the cut-norm
Approximating sparse binary matrices in the cut-norm Noga Alon Abstract The cut-norm A C of a real matrix A = (a ij ) i R,j S is the maximum, over all I R, J S of the quantity i I,j J a ij. We show that
More informationA Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity
A Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity Noga Alon Eldar Fischer Ilan Newman Asaf Shapira Abstract A common thread in all the recent results concerning
More informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationLecture 13: 04/23/2014
COMS 6998-3: Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 13: 04/23/2014 Spring 2014 Scribe: Psallidas Fotios Administrative: Submit HW problem solutions by Wednesday,
More informationEfficient testing of large graphs
Efficient testing of large graphs Noga Alon Eldar Fischer Michael Krivelevich Mario Szegedy Abstract Let P be a property of graphs. An ɛ-test for P is a randomized algorithm which, given the ability to
More informationA Characterization of the (natural) Graph Properties Testable with One-Sided Error
A Characterization of the (natural) Graph Properties Testable with One-Sided Error Noga Alon Asaf Shapira Abstract The problem of characterizing all the testable graph properties is considered by many
More information1.1 Szemerédi s Regularity Lemma
8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 2 Luca Trevisan August 29, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analysis Handout Luca Trevisan August 9, 07 Scribe: Mahshid Montazer Lecture In this lecture, we study the Max Cut problem in random graphs. We compute the probable
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationHomomorphisms in Graph Property Testing - A Survey
Homomorphisms in Graph Property Testing - A Survey Dedicated to Jaroslav Nešetřil on the occasion of his 60 th birthday Noga Alon Asaf Shapira Abstract Property-testers are fast randomized algorithms for
More informationarxiv: v2 [math.co] 20 Jun 2018
ON ORDERED RAMSEY NUMBERS OF BOUNDED-DEGREE GRAPHS MARTIN BALKO, VÍT JELÍNEK, AND PAVEL VALTR arxiv:1606.0568v [math.co] 0 Jun 018 Abstract. An ordered graph is a pair G = G, ) where G is a graph and is
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationThe Removal Lemma for Tournaments
The Removal Lemma for Tournaments Jacob Fox Lior Gishboliner Asaf Shapira Raphael Yuster August 8, 2017 Abstract Suppose one needs to change the direction of at least ɛn 2 edges of an n-vertex tournament
More informationRemoval Lemmas with Polynomial Bounds
Removal Lemmas with Polynomial Bounds Lior Gishboliner Asaf Shapira Abstract A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One
More informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationHARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY
HARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY SOURAV CHAKRABORTY 1 AND ELDAR FISCHER 1 AND ARIE MATSLIAH 2 AND RAPHAEL YUSTER 3 1 Department of Computer Science, Technion, Haifa 32000, Israel. E-mail
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationApplications of the Szemerédi Regularity Lemma Shagnik Das
Applications of the Szemerédi Regularity Lemma Shagnik Das Opening remarks It is difficult, if not impossible, to overstate the importance and utility of Szemerédi s celebrated Regularity Lemma in Extremal
More informationA Characterization of the (natural) Graph Properties Testable with One-Sided Error
A Characterization of the (natural) Graph Properties Testable with One-Sided Error Noga Alon Asaf Shapira Abstract The problem of characterizing all the testable graph properties is considered by many
More informationSZEMERÉDI S REGULARITY LEMMA 165
SZEMERÉDI S REGULARITY LEMMA 165 9.4 SZEMERÉDI S REGULARITY LEMMA In this section we describe a fundamental result, the Regularity Lemma, proved by Endre Szemerédi in the 70s. The original motivation for
More informationInduced Ramsey-type theorems
Induced Ramsey-type theorems Jacob Fox Benny Sudakov Abstract We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and
More informationSHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS. Joanna Polcyn. Department of Discrete Mathematics Adam Mickiewicz University
Discussiones Mathematicae Graph Theory 24 (2004 ) 469 484 SHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS Joanna Polcyn Department of Discrete Mathematics Adam Mickiewicz University Poznań e-mail: joaska@amu.edu.pl
More informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationA Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity
A Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity ABSTRACT Noga Alon Tel-Aviv University and IAS nogaa@tau.ac.il Ilan Newman Haifa University ilan@cs.haifa.ac.il
More informationVAN DER WAERDEN S THEOREM.
VAN DER WAERDEN S THEOREM. REU SUMMER 2005 An arithmetic progression (AP) of length k is a set of the form A = {a, a+d,..., a+(k 1)d} which we ll also denote by A = a+[0, k 1]d. A basic result due to Van
More informationRainbow matchings and rainbow connectedness
Rainbow matchings and rainbow connectedness Alexey Pokrovskiy arxiv:1504.05373v1 [math.co] 21 Apr 2015 Methods for Discrete Structures, Freie Universität, Berlin, Germany. Email: alja123@gmail.com Keywords:
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationProbabilistic Method. Benny Sudakov. Princeton University
Probabilistic Method Benny Sudakov Princeton University Rough outline The basic Probabilistic method can be described as follows: In order to prove the existence of a combinatorial structure with certain
More informationMATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets
MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number
More informationApproximate Hypergraph Partitioning and Applications
Approximate Hypergraph Partitioning and Applications Eldar Fischer Arie Matsliah Asaf Shapira Abstract Szemerédi s regularity lemma is a corner-stone result in extremal combinatorics. It (roughly) asserts
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research April 25 Microsoft Research Technical Report # MSR-TR-25-9 Abstract Szemerédi s Regularity Lemma is a fundamental tool
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationMost Continuous Functions are Nowhere Differentiable
Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationForcing unbalanced complete bipartite minors
Forcing unbalanced complete bipartite minors Daniela Kühn Deryk Osthus Abstract Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of
More informationHypergraph Regularity and the multidimensional Szemerédi Theorem. W. T. Gowers
Hypergraph Regularity and the multidimensional Szemerédi Theorem. W. T. Gowers Abstract. We prove analogues for hypergraphs of Szemerédi s regularity lemma and the associated counting lemma for graphs.
More informationREGULI AND APPLICATIONS, ZARANKIEWICZ PROBLEM
REGULI AN APPLICATIONS, ZARANKIEWICZ PROBLEM One of our long-term goals is to pursue some questions of incidence geometry in R 3. We recall one question to direct our focus during this lecture. Question
More informationDistance between two k-sets and Path-Systems Extendibility
Distance between two k-sets and Path-Systems Extendibility December 2, 2003 Ronald J. Gould (Emory University), Thor C. Whalen (Metron, Inc.) Abstract Given a simple graph G on n vertices, let σ 2 (G)
More informationLecture 13: Spectral Graph Theory
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 13: Spectral Graph Theory Lecturer: Shayan Oveis Gharan 11/14/18 Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationNotes on MapReduce Algorithms
Notes on MapReduce Algorithms Barna Saha 1 Finding Minimum Spanning Tree of a Dense Graph in MapReduce We are given a graph G = (V, E) on V = N vertices and E = m N 1+c edges for some constant c > 0. Our
More informationCOLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES BY DANIEL WESLEY CRANSTON
COLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES BY DANIEL WESLEY CRANSTON B.S., Greenville College, 1999 M.S., University of Illinois, 2000 THESIS Submitted in partial fulfillment of the
More information18.5 Crossings and incidences
18.5 Crossings and incidences 257 The celebrated theorem due to P. Turán (1941) states: if a graph G has n vertices and has no k-clique then it has at most (1 1/(k 1)) n 2 /2 edges (see Theorem 4.8). Its
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationBipartite graphs of approximate rank 1. W. T. Gowers
Bipartite graphs of approximate rank 1 W T Gowers 1 Introduction Quasirandomness is a central concept in graph theory, and has played an important part in arithmetic combinatorics as well Roughly speaking,
More informationA sequence of triangle-free pseudorandom graphs
A sequence of triangle-free pseudorandom graphs David Conlon Abstract A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More informationCombinatorial Optimization
Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is
More informationTHE STRUCTURE OF ALMOST ALL GRAPHS IN A HEREDITARY PROPERTY
THE STRUCTURE OF ALMOST ALL GRAPHS IN A HEREDITARY PROPERTY NOGA ALON, JÓZSEF BALOGH, BÉLA BOLLOBÁS, AND ROBERT MORRIS Abstract. A hereditary property of graphs is a collection of graphs which is closed
More informationGenerating all subsets of a finite set with disjoint unions
Generating all subsets of a finite set with disjoint unions David Ellis, Benny Sudakov May 011 Abstract If X is an n-element set, we call a family G PX a k-generator for X if every x X can be expressed
More informationCan a Graph Have Distinct Regular Partitions?
Can a Graph Have Distinct Regular Partitions? Noga Alon Asaf Shapira Uri Stav Abstract The regularity lemma of Szemerédi gives a concise approximate description of a graph via a so called regular partition
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationarxiv: v1 [math.co] 1 Oct 2013
Tiling in bipartite graphs with asymmetric minimum degrees Andrzej Czygrinow and Louis DeBiasio November 9, 018 arxiv:1310.0481v1 [math.co] 1 Oct 013 Abstract The problem of determining the optimal minimum
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More information7 The structure of graphs excluding a topological minor
7 The structure of graphs excluding a topological minor Grohe and Marx [39] proved the following structure theorem for graphs excluding a topological minor: Theorem 7.1 ([39]). For every positive integer
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationThe Effect of Induced Subgraphs on Quasi-Randomness
The Effect of Induced Subgraphs on Quasi-Randomness Asaf Shapira Raphael Yuster Abstract One of the main questions that arise when studying random and quasi-random structures is which properties P are
More informationInterval minors of complete bipartite graphs
Interval minors of complete bipartite graphs Bojan Mohar Department of Mathematics Simon Fraser University Burnaby, BC, Canada mohar@sfu.ca Arash Rafiey Department of Mathematics Simon Fraser University
More informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
More informationApplications of the Sparse Regularity Lemma
Applications of the Sparse Regularity Lemma Y. Kohayakawa (Emory and São Paulo) Extremal Combinatorics II DIMACS 2004 1 Szemerédi s regularity lemma 1. Works very well for large, dense graphs: n-vertex
More informationQuasi-randomness of graph balanced cut properties
Quasi-randomness of graph balanced cut properties Hao Huang Choongbum Lee Abstract Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random
More informationThe critical window for the classical Ramsey-Turán problem
The critical window for the classical Ramsey-Turán problem Jacob Fox Po-Shen Loh Yufei Zhao Abstract The first application of Szemerédi s powerful regularity method was the following celebrated Ramsey-Turán
More information16 1 Basic Facts from Functional Analysis and Banach Lattices
16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness
More informationIndependent sets and repeated degrees
Independent sets repeated degrees B. Bollobás A.D. Scott Department of Pure Mathematics Mathematical Statistics, University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, Engl. Department of Mathematics,
More informationUnit 2, Section 3: Linear Combinations, Spanning, and Linear Independence Linear Combinations, Spanning, and Linear Independence
Linear Combinations Spanning and Linear Independence We have seen that there are two operations defined on a given vector space V :. vector addition of two vectors and. scalar multiplication of a vector
More informationPolynomial-Time Perfect Matchings in Dense Hypergraphs
Polynomial-Time Perfect Matchings in Dense Hypergraphs Peter Keevash School of Mathematical Sciences, Queen Mary, University of London London E 4NS United Kingdom p.keevash@qmul.ac.uk Fiachra Knox School
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationLocally triangular graphs and normal quotients of n-cubes
Locally triangular graphs and normal quotients of n-cubes Joanna B. Fawcett The University of Western Australia 15 February, 2016 The triangular graph T n for n 2: Vertices 2-subsets of {1,...,n}. Adjacency
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationThe Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton
The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for
More informationPARTITIONING PROBLEMS IN DENSE HYPERGRAPHS
PARTITIONING PROBLEMS IN DENSE HYPERGRAPHS A. CZYGRINOW Abstract. We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic
More informationTesting Hereditary Properties of Ordered Graphs and Matrices
Testing Hereditary Properties of Ordered Graphs and Matrices Noga Alon, Omri Ben-Eliezer, Eldar Fischer April 6, 2017 Abstract We consider properties of edge-colored vertex-ordered graphs, i.e., graphs
More informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationLocal MAX-CUT in Smoothed Polynomial Time
Local MAX-CUT in Smoothed Polynomial Time Omer Angel 1 Sebastien Bubeck 2 Yuval Peres 2 Fan Wei 3 1 University of British Columbia 2 Microsoft Research Redmond 3 Stanford University November 9, 2016 Introduction
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More informationLimits of dense graph sequences
Limits of dense graph sequences László Lovász and Balázs Szegedy Microsoft Research One Microsoft Way Redmond, WA 98052 Technical Report TR-2004-79 August 2004 Contents 1 Introduction 2 2 Definitions and
More informationZ Algorithmic Superpower Randomization October 15th, Lecture 12
15.859-Z Algorithmic Superpower Randomization October 15th, 014 Lecture 1 Lecturer: Bernhard Haeupler Scribe: Goran Žužić Today s lecture is about finding sparse solutions to linear systems. The problem
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More information