Almost-spanning universality in random graphs
|
|
- Leo Allen
- 5 years ago
- Views:
Transcription
1 Almost-spaig uiversality i radom graphs David Colo Asaf Ferber Rajko Neadov Nemaja Škorić Abstract A graph G is said to be H(, )-uiversal if it cotais every graph o vertices with maximum degree at most. It is kow that for ay ε > 0 ad ay atural umber there exists c > 0 such that the radom graph G(, p) is asymptotically almost surely H((1 ε), )-uiversal for p c(log /) 1/.( Bypassig this ) atural boudary, we show that for 3 the same coclusio holds whe p = ω 1 1 log 5. 1 Itroductio Give a family of graphs H, a graph G is said to be H-uiversal if it cotais every member of H as a subgraph (ot ecessarily iduced). Uiversal graphs have bee studied quite extesively, particularly with respect to families of forests, plaar graphs ad graphs of bouded degree (see, for example, [4, 5, 8, 9, 11, 13, 14, 15, 17] ad their refereces). I particular, it is of iterest to fid sparse uiversal graphs. Let H(, ) be the family of all graphs o vertices with maximum degree at most. Buildig o earlier work with several authors [2, 5, 6], Alo ad Capalbo [3, 4] showed that there are graphs with at most c 2 2/ edges which are H(, )-uiversal. A simple coutig argumet shows that this result is best possible. The costructio of Alo ad Capalbo is explicit. A earlier approach had bee to study whether radom graphs could be H(, )-uiversal. The biomial radom graph G(, p) is the graph formed by choosig every edge of a graph o vertices idepedetly with probability p. We say that G(, p) satisfies a property P asymptotically almost surely (a.a.s.) if Pr(G(, p) P) teds to 1 as teds to ifiity. The first result o uiversality i radom graphs was proved by Alo, Capalbo, Kohayakawa, Rödl, Ruciński ad Szemerédi [5], who showed that for ay ε > 0 there exists a costat c > 0 such that the radom graph G(, p) is a.a.s. H((1 ε), )-uiversal for p c(log /) 1/. I this theorem, some slack is allowed by oly askig that the radom graph cotais subgraphs with (1 ε) vertices. However, oe ca also ask whether the radom graph G(, p) cotais all subgraphs of maximum degree with exactly vertices, that is, whether it is H(, )-uiversal. Because we o loger have ay extra room to maoeuvre, this problem is substatially more difficult to treat tha the almost-spaig versio. Nevertheless, Dellamoica, Kohayakawa, Rödl ad Ruciński [14] have show that for ay atural umber 3 there exists a costat c > 0 such that Mathematical Istitute, Oxford OX2 6GG, Uited Kigdom. david.colo@maths.ox.ac.uk. Research supported by a Royal Society Uiversity Research Fellowship. Departmet of Mathematics, Yale Uiversity ad Departmet of Mathematics, MIT. asaf.ferber@yale.edu, ferbera@mit.edu. Istitute of Theoretical Computer Sciece, ETH Zürich, 8092 Zürich, Switzerlad. {readov skoric}@if.ethz.ch. 1
2 G(, p) is a.a.s. H(, )-uiversal for p c(log /) 1/. The case = 2 was later treated by Kim ad Lee [17], who obtaied similar bouds to those i [14]. These results o embeddig large bouded-degree graphs i the radom graph have proved useful i other cotexts [12, 18]. To give a example, we defie the size Ramsey umber ˆr(H) of a graph H to be the smallest umber of edges m i a graph G which is Ramsey with respect to H, that is, such that ay 2-colourig of the edges of G cotais a moochromatic copy of H. A famous result of Beck [10] states that the size Ramsey umber of the path P with vertices is at most c for some fixed costat c > 0. A extesio of this result to graphs of maximum degree was recetly give by Kohayakawa, Rödl, Schacht ad Szemerédi [18], who showed that there is a costat c > 0 depedig oly o such that if H is a graph with vertices ad maximum degree the ˆr(H) c 2 1/ (log ) 1/. A key compoet of this proof is a embeddig lemma like that used i [5]. Oe could therefore hope to improve this boud by improvig the bouds for uiversality i radom graphs. Here we make some iitial progress o these problems by improvig the theorem of Alo, Capalbo, Kohayakawa, Rödl, Ruciński ad Szemerédi [5] o almost-spaig uiversality as follows. Theorem 1.1. For ay costat ε > 0 ad iteger 3, the radom) graph G(, p) is a.a.s. uiversal for the family H((1 ε), ), provided that p = ω ( 1 1 log 5. This result bypasses a atural barrier, sice (log /) 1/ is roughly the lowest probability at which we ca expect that every collectio of vertices will have may eighbors i commo, a coditio which is extremely useful if oe wishes to embed graphs of maximum degree. O the other had, the lowest probability at which oe might hope that the radom graph G(, p) is a.a.s. H((1 ε), )-uiversal is 2/( +1). Ideed, below this probability, G(, p) will typically ot cotai (1 ε) +1 vertex-disjoit copies of K +1 (see, for example, [16]). Thus, for = 3 our result is optimal up to the logarithmic factor, while for 4 the gap remais. I provig Theorem 1.1, we will make use of a recet result of Ferber, Neadov ad Peter [15] which improves the bouds i [14] for families H H(, ) of graphs which have o dese subgraphs, i.e. o subgraphs of desity /2. Whe embeddig a graph H H((1 ε), ), we will first fid a subgraph H H by removig all small compoets ad certai short cycles i H. We the use the mai result of [15] to embed H, after which we replace the short cycles ad small compoets to fid a embeddig of H. 1.1 Notatio For a graph G = (V, E), we deote by v(g) ad e(g) the size of the vertex ad edge sets, respectively. For a vertex v V, we write Γ (i) G (v) := {w V : dist(v, w) = i} for the set of vertices at distace exactly i from v. For simplicity, we let Γ (0) G (v) := {v} ad Γ G(v) := Γ (1) G (v). Furthermore, for a set S V, we defie Γ (i) G (S) := {w V : mi v S dist(v, w) = i}. Similarly, we let B (i) G (v) := (v) be the ball of radius i aroud v i G, i.e., the set of all vertices at distace at most i from i j=0 Γ(j) G v. For a iteger k ad a set of vertices S V, we say that S is k-idepedet if B (k) G (v) (S\{v}) =, i.e., every two vertices i S are at distace at least k + 1. If there is o risk of ambiguity, we omit G from the subscript. 2
3 Give a (hyper)graph H = (V, E), we say that two edges e 1, e 2 E are idepedet if e 1 e 2 =. For two graphs G ad G, we write G = G if they are isomorphic. Fially, a family of subsets A 1,..., A k V, for some iteger k, is a partitio of V if A i A j = for all distict i, j {1,..., k} ad V = k i=1 A i. We use the stadard asymptotic otatio O, o, Ω ad ω. Furthermore, give two fuctios a ad b we write a b if a = o(b), ad a b if a = ω(b). 2 Tools ad prelimiaries I this sectio, we preset some tools to be used i the proof of our mai result. 2.1 Probabilistic tools We will use lower tail estimates for radom variables which cout the umber of copies of certai graphs i a radom graph. The followig versio of Jaso s iequality, tailored for graphs, will suffice. This statemet follows immediately from Theorems ad i [7]. Theorem 2.1 (Jaso s iequality). Let p = p() (0, 1) ad cosider a family {H i } i I of subgraphs of the complete graph o the vertex set []. Let G G(, p) ad, for each i I, let X i deote the idicator radom variable for the evet that H i G ad, for each ordered pair (i, j) I I with i j, write H i H j if E(H i ) E(H j ). The, for X = X i, H i H µ = E[X] = p e(hi), i I δ = E[X i X j ] = (i,j) I I H i H j (i,j) I I H i H j p e(h i)+e(h j ) e(h i H j ) ad ay 0 < γ < 1, we have Pr[X < (1 γ)µ] e γ 2 µ 2 2(µ+δ). 2.2 Uiversality for icely partitioable graphs I the followig defiitio, we itroduce a family of graphs that admit a ice partitio. Defiitio 2.2. Let, d ad t be positive itegers ad let ε be a positive umber. The family of graphs F(, t, ε, d) cosists of all graphs H o vertices for which there exists a partitio W 0,..., W t of V (H) such that (i) W t = ε, (ii) W 0 = Γ(W t ), (iii) W t is 3-idepedet, (iv) W i is 2-idepedet for every 1 i t 1, ad 3
4 (v) for every 1 i t ad for every w W i, w has at most d eighbors i W 0... W i 1. The followig result, due to Ferber, Neadov ad Peter [15], shows that for a appropriate p a typical G G(, p) is F(, t, ε, d)-uiversal. Theorem 2.3 (Theorem 4.1 i [15]). Let ad t be positive itegers, let d = d() 2 be a iteger ad let ε < 1/(2d). The the radom graph G(, p) is a.a.s. F(, t, ε, d)-uiversal, provided that p = ω ( ε 1 t 1/d log 2 ). We remark that this result is actually stroger tha we eed, sice it gives a statemet about spaig graphs while i this paper we oly deal with almost-spaig graphs. Thus, whe applyig Theorem 2.3, we will make our graph spaig by addig a certai umber of isolated vertices. 2.3 Uiversality for graphs of small size I this sectio, we prove auxiliary lemmas which will allow us to igore small compoets i the proof of Theorem 1.1 (see Phase III i the proof of Theorem 1.1). Lemma 2.4. Let 3 ad k be itegers ad let H H(log k, ) be a coected graph with v(h) + 2. The G G(, p) cotais H with probability 1 e ω(), provided that p = ω ( 2/( +1)). Proof. Let (h 1,..., h v(h) ) be a arbitrary orderig of the vertices of H ad let V 1,..., V v(h) V (G) be disjoit subsets of order / log k. We wish to use Jaso s iequality to prove the lemma. For that, we will restrict our attetio to the caoical copies of H: the family {H i } i I cosists of all those copies of H i K with the property that the vertex h j belogs to the set V j for every j {1,..., v(h)}. We ow estimate the parameters µ ad δ defied i Theorem 2.1. The expected umber µ of {H i } i I i G satisfies ( ) v(h) ( ) v(h) µ = log k p e(h) log k p v(h) /2 where the last iequality follows from v(h) + 2. Next, ote that for ay proper subgraph J H we have e(j) ( ) v(j) 2 if v(j), ad e(j) 1 2 ((v(j) 1) + 1) = 1 2 (v(j) 1) otherwise, ( ) v(h) log k /( +1), where the secod estimate follows from the fact that H is coected. We ca ow rewrite δ as δ = p e(h i)+e(h j ) e(h i H j ) = p 2e(H) e(j). J H H i H j =J (i,j) I I H i H j Usig the observatios above, we may split the sum based o the size of v(j), gettig δ v(j) p 2e(H) ( J H H i H j =J v(j) 2 ) + J H v(j) +1 H i H j =J p 2e(H) (v(j) 1)/2. 4
5 We ca boud the umber of summads by first decidig o a embeddig of J, which ca be doe i (/ log k ) v(j) ways, ad the o a embeddig for the remaiig parts of the two copies of H which itersect o J (at most (/ log k ) 2(v(H) v(j)) ways), yieldig δ ( ) ( ) v(h) 2v(H) j v(h) 1 ( ) ( ) v(h) 2v(H) j j log k p 2e(H) (j 2) + j log k p 2e(H) (j 1)/2. j=2 j= +1 Fially, by pullig µ 2 outside, we obtai ( ) ( ) δ µ 2 v(h) j v(h) 1 ( ) ( ) v(h) j j log k p (j 2) + j log k p (j 1)/2. j=2 j= +1 By substitutig for p, we get the followig upper boud o the first sum, δ 1 := ( ) ( ) v(h) j j log k p (j 2) (log ) 2kj j j(j 1) j=2 j=2 = (log ) 2 k Proceedig similarly for the secod sum, we have δ 2 := v(h) 1 j= +1 ( ) ( v(h) j log k ) j p (j 1)/2 Sice j + 1 i the above sum, we have j=2 v(h) 1 j= (log ) 2 k j=2 +1 (j 1) j +j +1 (log ) 2 k 1 1/( +1) 1/. (log ) 2jk j j 1 j+1 +1 = 1 j +1 (log ) 2k(j+1) 1, thus it easily follows that δ 2 = o(1/). Summig up, we get δ = o(µ 2 /). Fially, by applyig Theorem 2.1 with parameters µ ad δ, we obtai Pr[X < µ/2] e µ2 /(8(µ+δ)), v(h) 1 +1 = j= +1 (log ) 2jk j+1 where X is the umber of copies of {H i } i I that appear i G. Sice µ, this implies the coclusio of the lemma. The ext lemma deals with graphs o at most + 1 vertices. Sice we treat as a costat, it is a stadard applicatio of Jaso s iequality ad we omit the proof. Lemma 2.5. Let 3 be a iteger ad H ay graph o at most +1 vertices. The G G(, p) cotais H with probability 1 e ω(), provided that p = ω( 2/( +1) ). Fially, we make use of Lemmas 2.4 ad 2.5 to show that every large iduced subgraph of G(, p) cotais all coected graphs from H(log k, ) simultaeously. Lemma 2.6. Let ε > 0 be a costat ad 3 ad k itegers. The, for p = ω( 2/( +1) ), G G(, p) a.a.s. has the followig property: for every V V (G) of order V ε, G[V ] cotais all coected graphs H H(log k, )
6 Proof. Let G G(, p), with p as stated i the lemma. By Lemmas 2.4 ad 2.5, for a fixed subset V V (G) of order V ε ad a coected graph H H(log k+1 (ε), ), we have Pr[H G[V ]] = 1 e ω(). Note that as log k log k+1 (ε), these estimates also apply for every H H(log k, ). Sice there are at most 2 choices for V ad at most log k v H /2 v H =2 e H =1 ( ) v 2 H e H ( log log 2k 2k ) log k = o(2 ) coected graphs H H(log k, ), a applicatio of the uio boud completes the proof. 2.4 Systems of disjoit represetatives i hypergraphs The followig lemma will allow us to remove ad replace a set of short cycles i the proof of Theorem 1.1 (see Phase II i the proof of Theorem 1.1). We make o effort to optimize the logarithmic factor i the boud o the edge probability p. Lemma 2.7. Let ε > 0 be a costat, 3, 3 g 2 log ad t ε/8 log 3 be itegers ad let D [] be a subset of order D = ε/ log. The G G(, p) satisfies the followig with probability at least 1 o(1/), provided that p ( log 7 / ) 1/( 1) : for ay family of subsets {Wi,j } (i,j) [t] [g], where (i) W i,j V (G) \ D ad W i,j = 2 for all (i, j) [t] [g], ad (ii) W i,j W i,j = for all i i, there exists a family of cycles {C i = (c i1,..., c ig )} i [t], each of legth g, such that (i) V (C i ) G[D] ad V (C i ) V (C i ) =, for all i i, ad (ii) W i,j Γ G (c ij ) for all (i, j) [t] [g]. Lemma 2.7 will follow as a corollary of Lemma 2.9 ad the followig geeralizatio of Hall s matchig criterio due to Aharoi ad Haxell [1]. Theorem 2.8 (Corollary 1.2, [1]). Let g be a positive iteger ad H = {,..., H t } a family of g-uiform hypergraphs o the same vertex set. If, for every I [t], the hypergraph i I H i cotais a matchig of size greater tha g( I 1), the there exists a fuctio f : [t] t i=1 E(H i) such that f(i) E(H i ) ad f(i) f(j) = for i j. The followig lemma allows us to fid the matchigs required by Theorem 2.8 i a greedy way, i.e., edge by edge. Lemma 2.9. Let ε > 0 be a costat, 3, 3 g 2 log ad k ε/8 log 3 be itegers ad let D [] be a subset of size D = ε/ log. The G G(, p) satisfies the followig with probability at least 1 o(1/ 2 ), provided that p ( log 7 / ) 1/( 1) : for ay family of subsets {Wi,j } (i,j) [k] [g], where 6
7 (i) W i,j V (G) \ D ad W i,j = 2 for all (i, j) [k] [g], ad (ii) W i,j W i,j = for all i i, ad ay subset D D of order D D g 2 k, there exists i {1,..., k} ad a cycle C = (c 1,..., c g ) G[D ] of legth g such that W i,j Γ G (c j ) for all j {1,..., g}. Proof. Our aim is to show that for a subset D D ad a family {W i,j } (i,j) [k] [g] satisfyig properties (i) ad (ii), the graph G G(, p) fails to satisfy the coclusio of the lemma with probability at most e ω(k log3 ). Sice we ca choose the family {W i,j } (i,j) [k] [g] i at most ( kg 2) 2 ( 2)kg log = 2 o(k log3 ) ways ad D i at most ( g k) 2 g 2 k log 2 4k 2 log3 ways, the lemma follows by a simple applicatio of the uio boud. It remais to prove the desired boud o the probability of a failure. We first itroduce some otatio. Give a cycle C = (c 1,..., c g ) K of legth g, we defie the graph C i by V (C i) = V (C) g W i,j, ad E(C i) = E(C) j=1 j [g] v W i,j {c j, v}. Furthermore, let V 1,..., V g D be arbitrarily chose disjoit subsets of order ε/4 log 2 (this is possible sice D ε/2 log ), defie the family of caoical cycles C as ad set C := {C = (c 1,..., c g ) C is a cycle ad c j V j for all j [g]} C + := {C i C C ad i [k]}. Observe that if G cotais ay graph from C +, the G cotais the desired cycle. Usig Jaso s iequality, we upper boud the probability that this does ot happe. I the remaider of the proof, we will estimate the parameters µ ad δ defied i Theorem 2.1. Note that each graph C + C + appears i G with probability p g+( 2)g = p ( 1)g. Therefore, ( ) ε g µ = C + p ( 1)g = k 4 log 2 p ( 1)g k log 3, where we used the assumptio that g 3. Next, we wish to show that δ = o(µ 2 /k log 3 ). By defiitio, we have δ = p e(c i)+e(c j) e((c i) (C j)). i,j [k] C,C C C i C j We cosider the cases i j ad i = j separately. First, if C i C j for i j ad C, C C, the we have (C i) (C j) = C C. Let J := C C ad observe that e(j) 1, as otherwise C i ad C j would ot have ay edges i commo. Let J 1 be the family cosistig of all possible graphs of the form C C, J 1 := {J = C C C, C C ad e(j) 1}. 7
8 We ca ow estimate the cotributio of such pairs to δ as follows: δ 1 = p e(c i)+e(c j) e(c C ) = i j i j k 2 C,C C e(c C ) 1 J J 1 ( ε 4 log 2 ) 2(g v(j)) p 2( 1)g e(j) = µ 2 J J 1 C,C C C C =J J J 1 ( ε 4 log 2 p 2( 1)g e(j) ) 2v(J) p e(j). Sice e(j) = 1 for v(j) = 2 ad e(j) v(j) otherwise, we ca boud the last sum by J J 1 ( ) ε 2v(J) 4 log 2 p e(j) ( ) ε 4 4 log 2 p 1 + ( ) ε 2v(J) 4 log 2 p v(j). J J 1 J J 1 v(j)=2 v(j)>2 Observe that there are at most ( g v J ) ( ε/4 log 2 ) v J J J 1 ( ) ε 2v(J) 4 log 2 p e(j) (2 log ) 2 ( 4 log 2 ε ( ) ( g ε 2 4 log 2 v J >2 ) 2 1/( 1) + ( 2 log graphs J J 1 o v J vertices. Thus, we have ) 2 p 1 + ( g v J >2 v J v J ) ( ) ε vj 4 log 2 p v J ) ( ε 4 log 2 1 1/( 1) ) vj 1, where we used that 3. Therefore, we obtai δ 1 = o(µ 2 /). Let us ow cosider the case C i C i, for some i [k] ad distict cycles C, C C. Let J := C C ad observe that v(j) 1 ad v(j) g 1. As before, let J 2 be the family cosistig of all possible graphs of the form C C, J 2 := {J = C C C, C C ad v(j) {1,..., g 1}}. Note that if V (J) V q = {v} for some q {1,..., g}, the {v, w} E(C i C i) for all w W i,q. Moreover, sice these are the oly edges i E(C i C i) \ E(J), e(c i C i) = e(j) + v(j)( 2). With these observatios i had, we ca boud the cotributio of such pairs to δ as follows: δ 2 = i [k] = k J J 2 C,C C v(c C ) 1 ( ε 4 log 2 p e(c i)+e(c i) e(c i C i) = i [k] ) 2(g v(j)) p 2( 1)g (e(j)+v(j)( 2)) µ2 k J J 2 C,C C C C =J J J 2 ( ε 4 log 2 p 2( 1)g (e(j)+v(j)( 2)) ) 2v(J) p (e(j)+v(j)( 2)). Sice J is a subgraph of a cycle, we have e(j) v(j). Therefore, we ca boud the last sum by J J 2 ( ) ε 2v(J) 4 log 2 p (e(j)+v(j)( 2)) ( ) ε 2v(J) 4 log 2 p v(j)( 1). J J 2 8
9 Note that there are at most ( g v J ) (ε/4 log 2 ) v J J J 2 ( ) ε 2v(J) 4 log 2 p (e(j)+v(j)( 2)) graphs J J 2 o v J vertices. Thus, we have g 1 v J =1 g 1 v J =1 ( g v J ) ( ) ε vj 4 log 2 p v(j)( 1) ( 2 log 4 log2 ε ) vj log 7 1 log 3. Therefore, we obtai δ 2 = o(µ 2 /(k log 3 )). Fially, we have δ δ 1 +δ 2 = o(µ 2 /(k log 3 )) ad Theorem 2.1 gives the desired upper boud o the probability that G does ot cotai ay graph from C +, completig the proof of the lemma. Proof of Lemma 2.7. Let G G(, p), with p as stated i the lemma. For each i [t], we defie a g-uiform hypergraph H i := (D, E i ) as follows: a set of vertices {v 1,..., v g } D forms a hyperedge if ad oly if G[{v 1,..., v g }] cotais a cycle C = (c 1,..., c g ) such that W i,j Γ G (c j ) for all j [g]. Observe that the existece of a fuctio f with properties as i Theorem 2.8, applied to the family H := {,..., H t }, implies the existece of a desired family of cycles. Therefore, it is sufficiet to prove that, with probability at least 1 o(1/), for every I [t] the hypergraph i I E(H i) cotais a matchig of size at least g I. Sice the requiremets o the family {W i,j } (i,j) [t] [g] are the same as i Lemma 2.9, it follows from the uio boud that, with probability at least 1 o(1/), G satisfies the property give by Lemma 2.9 for D, g ad every k [t]. Let I [t] be a subset of size k for some k [t] ad set D :=. We ow apply the followig procedure kg times: usig the property give by Lemma 2.9 for D, fid a hyperedge e i I E(H i) such that e D = ad set D := D e. Sice D kg 2 throughout the whole procedure, we ca ideed apply Lemma 2.9 to fid such a hyperedge e. Furthermore, sice every edge is vertex disjoit from the previously obtaied edges, we have costructed a matchig i i I E(H i) of size kg. As I [t] was chose arbitrarily, this cocludes the proof of the lemma. 3 Proof of Theorem 1.1 Our proof strategy goes as follows. Give a graph H H((1 ε), ), we first remove small coected compoets from H, writig for the resultig graph. Workig i, we the remove some carefully chose iduced cycles of legth at most 2 log i such a way that the resultig graph H 2 belogs to the family of graphs F((1 ε ), Θ(log 3 ), ε, 1), for some parameters ε ad ε tedig to zero with ε. Now, usig Theorem 2.3, we fid a embeddig of H 2. The, usig Lemma 2.7, we replace the removed cycles. Fially, usig Lemma 2.6, we complete the embeddig of H by embeddig small compoets oe by oe. We will ow give a formal descriptio of this procedure. Preparig the graph G. Fix some ε > 0 ad iteger 3. Let R, D 3,..., D 2 log [] be arbitrarily chose disjoit subsets of {1,..., } such that R = (1 ε/2) ad D i = ε/4 log for each i {3,..., 2 log }. Let G be a graph with the followig properties: (i) the iduced subgraph G[R] is F((1 ε/2), ( 2 + 1)q + 1, ε, 1)-uiversal, where q = 65ε 1 log 3 ad ε = mi{1/2, ε/(2 ε)}, 9
10 (ii) for every subset V V (G) of order V ε, the iduced subgraph G[V ] cotais every coected graph from the family H(log 4, ), ad (iii) G satisfies the property give by Lemma 2.7 for every g {3,..., 2 log }, t ε/(32 log 3 ) ad D = D g. Observe that by Theorem 2.3 ad Lemmas 2.6 ad 2.7, G G(, p) satisfies properties (i)-(iii) asymptotically almost surely, provided that p = ω ( 1/( 1) log 5 ). We remark that the boud o p here is determied by Theorem 2.3. Preparig the graph H. Let H H((1 ε), ) ad let H be the subgraph which cosists of all coected compoets of H with at least log 4 vertices. Moreover, let I V ( ) be a maximal (64ε 1 log 3 )-idepedet set i. Claim 3.1. I ε 32 log 3. Proof. Let u, v I be two distict vertices from I. The B (32ε 1 log 3 ) (u) B (32ε 1 log 3 ) (v) =, as otherwise we would have dist(u, v) 64ε 1 log 3 ad the set I would ot be (64ε 1 log 3 )- idepedet. O the other had, for every v I we have that either Γ (i) (v) for every i {1,..., 32ε 1 log 3 } or B (32ε 1 log 3 ) (v) cotais the whole coected compoet of v, which is of order at least log 4. I either case, we have B (32ε 1 log 3 ) (v) 32ε 1 log 3 ad the desired boud o I follows. The followig observatio plays a crucial role i our argumet. Claim 3.2. For every vertex v I at least oe of the followig properties hold: (a) B (log ) (v) cotais a vertex w with deg H1 (w) 1, or (log ) (b) [B (v)] cotais a cycle of legth at most 2 log. Proof. Let us assume the opposite, i.e., for every vertex w B (log ) (log ) (v) we have deg H1 (w) = ad (log ) [B (v)] cotais o cycle of legth at most 2 log. The [B 3, it cotais at least log j=1 ( 1)j > vertices, which is clearly a cotradictio. (v)] is a tree ad, sice Let us write I a for the set of all vertices i I which satisfy property (a) of Claim 3.2 ad set (log ) I b := I \ I a. Furthermore, for each v I b, let C v be a cycle of smallest legth i [B (v)], let l v deote its legth ad fix a arbitrary orderig [(c 1 v,..., c lv v ) of the vertices alog C v. By miimality, ] C v is a iduced cycle. Fially, let H 2 := \ v I V (C b v) ad ote that (3 log ) B (v) V (H 2 ) = { (3 log ) B (v), for v I a, (3 log ) B (v) \ V (C v ), for v I b. (1) Phase I: Embeddig H 2 ito G[R]. We claim that there exists a embeddig of H 2 ito G[R]. Let H 2 be a graph o (1 ε/2) vertices obtaied from H 2 by addig isolated vertices. Usig property (i) of the graph G, i order to show that there exists a embeddig of H 2 ito G[R], it 10
11 will suffice to prove that H 2 F((1 ε/2), ( 2 + 1)q + 1, ε, 1), where q = 65ε 1 log 3 ad ε = mi{1/2, ε/(2 ε)}. We prove this by fidig a partitio W 0, W 1,..., W ( 2 +1)q+1 of V (H 2 ) with the followig properties: (i) W ( 2 +1)q+1 = ε (1 ε/2), (ii) W 0 = Γ H 2 (W ( 2 +1)q+1), (iii) W ( 2 +1)q+1 is 3-idepedet (i H 2 ), (iv) W i is 2-idepedet (i H 2 ) for every 1 i ( 2 + 1)q, ad (v) for every 1 i ( 2 + 1)q + 1 ad for every w W i, w has at most 1 eighbors i W 0... W i 1. First, ote that H 2 cotais at least ε/2 isolated vertices as V (H 2) (1 ε). Sice ε ε/(2 ε) or equivaletly ε (1 ε/2) < ε/2, we ca set W ( 2 +1)q+1 to be a set of ε (1 ε/2) isolated vertices. The W 0 = ad W ( 2 +1)q+1 is trivially 3-idepedet. Furthermore, let S q V (H 2 ) \ W ( 2 +1)q+1 be the set of all remaiig vertices i H 2 with degree at most 1 ad observe that for each v I, we have (3 log ) S q B (v). (2) For v I a, this follows from (1) ad the defiitio of the set I a. Whe v I b, we have from (1) (3 log ) (3 log ) ad B (v) 3 log > V (C v ) that B (v) V (H 2 ). Thus there exists a vertex (3 log ) w B (v) V (H 2 ) adjacet to some vertex i C v, ad clearly deg H2 (w) 1. Next, for each i {1,..., q 1}, we defie S q i := Γ (i) H 2 (S q ). We first show that S 1,..., S q, W ( 2 +1)q+1 is a partitio of V (H 2 ). Sice disjoitess follows from the costructio, it suffices to prove that for each w V (H 2 ) \ W ( 2 +1)q+1 we have B (q 1) H 2 (w) S q. This ca be see as follows. Sice I is a maximal (64ε 1 log 3 )-idepedet set i, for each vertex w V (H 2 ) \ I we have B (64ε 1 log 3 ) (w) I. Otherwise, we could exted I, cotradictig its maximality. Thus, from (2) we coclude that for each w V (H 2 ) \ I we have B (q 1) (w) S q. Let us ow cosider the shortest path i from w to a vertex s S q, ad deote the vertices alog such a path as w = p 0, p 1, p 2,..., p q = s, for some q q 1. If all vertices p 1,..., p q V (H 2 ), the clearly s B q 1 H 2 (w). Otherwise, let i be the smallest idex such that p i / V (H 2 ). But the deg H2 (p i 1) 1 ad thus by the defiitio p i 1 S q, which implies B q 1 H 2 (w) S q. This shows that S 1,..., S q, W ( 2 +1)q+1 is ideed a partitio of V (H 2 ). Furthermore, by costructio, for each i {1,..., q 1} ad each vertex v S i, v has at least oe eighbor i q j=i+1 S j ad thus at most 1 eighbors i i 1 j=0 S j. However, the sets S i are ot ecessarily 2-idepedet i H 2. This ca be fixed i the followig way. The square of H 2, deoted by (H 2 )2, has maximum degree at most 2. Therefore, (H 2 )2 ca be partitioed ito 2 +1 sets L 1,..., L 2 +1 which are idepedet i (H 2 )2 ad thus 2-idepedet i H 2. Now, by settig W (i 1)( 2 +1)+j := S i L j for every i {1,..., q} ad j {1,..., 2 + 1}, we obtai a partitio of V (H 2 ) satisfyig properties (i) (v). 11
12 To coclude, we have show that H 2 F((1 ε/2), ( 2 + 1)q + 1, ε, 1). Thus, by property (i) of the graph G, there exists a embeddig f : V (H 2 ) R of H 2 ito G[R]. Phase II: Embeddig removed cycles. Cosider some g {3,..., 2 log } ad let I g I b be the set of all idices v I b such that l v = g. For each (v, j) I g [g], let W v,j := f(γ H (c j v) V (H 2 )) ad observe that such family of subsets satisfies the requiremets of Lemma 2.7 with D = D g. Therefore, by property (iii) of the graph G, there exists a family {(c v,1,..., c v,g )} v Ig of vertex disjoit cycles i ] G[D g ] such that settig f(c j v) := c v,j for every (v, j) I g [g] defies a embeddig of H 2 [ v I C g v ito G[R D g ]. Sice this holds for every 3 g 2 log ad the sets D 3,..., D 2 log are disjoit, we obtai a embeddig of ito G. Phase III: Embeddig small compoets. As a last step, we have to exted our embeddig of to a embeddig of the whole graph H. Usig the facts that H is of order (1 ε) ad that each compoet of H which is ot i is of order at most log 4, we ca greedily embed these compoets oe by oe as follows. Cosider oe such compoet ad let V V (G) be the set of vertices which are ot a image of some already embedded vertex of H. The V ε ad by property (ii) of the graph G, G[V ] cotais a embeddig of the required compoet. Repeatig the same argumet for each compoet which has ot yet bee embedded, we obtai a embeddig of the graph H. 4 Cocludig remarks The observat reader will have oticed that our argumet does ot apply whe = 2. I this case, oe caot hope to show that uiversality holds all the way dow to p 1/( 1) = 1. Eve to fid a collectio of (1 ε) 3 disjoit triagles, the probability must be at least 2/3. Sice every graph with maximum degree 2 is a disjoit uio of paths ad cycles, it is ot too hard to use argumets similar to those of Sectio 2.3 to show that for ay ε > 0 there exists a costat c > 0 such that if p c 2/3, the radom graph G(, p) is a.a.s. H((1 ε), 2)-uiversal. Our proof relies heavily o the fact that the graphs we are hopig to embed are almost spaig rather tha spaig. I particular, we either kow how to complete the removed cycles or how to add small compoets back ito the graph without makig heavy use of the almost spaig coditio. Give this, it seems likely that a spaig aalogue of Theorem 1.1 will require ew ideas. We have already metioed that a modificatio of the embeddig techiques from Alo et al. [5] was used by Kohayakawa, Rödl, Schacht ad Szemerédi [18] to prove a subquadratic boud o the size Ramsey umber of bouded-degree graphs. It would be iterestig to kow whether our embeddig techique might be useful for improvig this boud. Refereces [1] R. Aharoi ad P. Haxell. Hall s theorem for hypergraphs. J. Graph Theory, 35(2):83 88, [2] N. Alo ad V. Asodi. Sparse uiversal graphs. J. Comput. Appl. Math., 142(1):1 11,
13 [3] N. Alo ad M. Capalbo. Sparse uiversal graphs for bouded-degree graphs. Radom Structures & Algorithms, 31(2): , [4] N. Alo ad M. Capalbo. Optimal uiversal graphs with determiistic embeddig. I Proceedigs of the Nieteeth Aual ACM-SIAM Symposium o Discrete Algorithms, SODA 08, pages , Philadelphia, PA, USA, Society for Idustrial ad Applied Mathematics. [5] N. Alo, M. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, ad E. Szemerédi. Uiversality ad tolerace. I Proceedigs of the 41st IEEE Symposium o Foudatios of Computer Sciece, pages IEEE, [6] N. Alo, M. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, ad E. Szemerédi. Near-optimum uiversal graphs for graphs with bouded degrees. I Approximatio, radomizatio, ad combiatorial optimizatio (Berkeley, CA, 2001), volume 2129 of Lecture Notes i Comput. Sci., pages Spriger, Berli, [7] N. Alo ad J. H. Specer. The Probabilistic Method. Joh Wiley & Sos, [8] L. Babai, F. R. K. Chug, P. Erdős, R. L. Graham, ad J. Specer. O graphs which cotai all sparse graphs. A. Discrete Math., 12:21 26, [9] J. Balogh, B. Csaba, ad W. Samotij. Local resiliece of almost spaig trees i radom graphs. Radom Structures & Algorithms, 38(1-2): , [10] J. Beck. O size Ramsey umber of paths, trees, ad circuits. I. J. Graph Theory, 7(1): , [11] S. N. Bhatt, F. R. K. Chug, F. T. Leighto, ad A. L. Roseberg. Uiversal graphs for bouded-degree trees ad plaar graphs. SIAM J. Discrete Math., 2(2): , [12] J. Böttcher, Y. Kohayakawa, ad A. Taraz. Almost spaig subgraphs of radom graphs after adversarial edge removal. Electro. Notes Discrete Math., 35: , [13] F. R. K. Chug ad R. L. Graham. O uiversal graphs for spaig trees. J. Lodo Math. Soc., 2(2): , [14] D. Dellamoica Jr, Y. Kohayakawa, V. Rödl, ad A. Ruciński. A improved upper boud o the desity of uiversal radom graphs. I LATIN 2012: Theoretical Iformatics, pages Spriger, [15] A. Ferber, R. Neadov, ad U. Peter. Uiversality of radom graphs ad raibow embeddig. To appear i Radom Structures & Algorithms, [16] S. Jaso, T. Luczak, ad A. Ruciski. Radom graphs, volume 45. Joh Wiley & Sos, [17] J. H. Kim ad S. J. Lee. Uiversality of radom graphs for graphs of maximum degree two. arxiv: , [18] Y. Kohayakawa, V. Rödl, M. Schacht, ad E. Szemeredi. Sparse partitio uiversal graphs for graphs of bouded degree. Adv. Math., 226(6): ,
Almost-spanning universality in random graphs
Almost-spaig uiversality i radom graphs David Colo Asaf Ferber Rajko Neadov Nemaja Škorić Abstract A graph G is said to be H(, )-uiversal if it cotais every graph o at most vertices with maximum degree
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationarxiv: v3 [math.co] 6 Aug 2014
NEAR PERFECT MATCHINGS IN -UNIFORM HYPERGRAPHS arxiv:1404.1136v3 [math.co] 6 Aug 2014 JIE HAN Abstract. Let H be a -uiform hypergraph o vertices where is a sufficietly large iteger ot divisible by. We
More informationFew remarks on Ramsey-Turán-type problems Benny Sudakov Λ Abstract Let H be a fixed forbidden graph and let f be a function of n. Denote by RT n; H; f
Few remarks o Ramsey-Turá-type problems Bey Sudakov Abstract Let H be a fixed forbidde graph ad let f be a fuctio of. Deote by ; H; f () the maximum umber of edges a graph G o vertices ca have without
More informationOn matchings in hypergraphs
O matchigs i hypergraphs Peter Frakl Tokyo, Japa peter.frakl@gmail.com Tomasz Luczak Adam Mickiewicz Uiversity Faculty of Mathematics ad CS Pozań, Polad ad Emory Uiversity Departmet of Mathematics ad CS
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationLovász Local Lemma a new tool to asymptotic enumeration?
Lovász Local Lemma a ew tool to asymptotic eumeratio? Liyua Licol Lu László Székely Uiversity of South Carolia Supported by NSF DMS Overview LLL ad its geeralizatios LLL a istace of the Poisso paradigm
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationEdge Disjoint Hamilton Cycles
Edge Disjoit Hamilto Cycles April 26, 2015 1 Itroductio l +l l +c I the late 70s, it was show by Komlós ad Szemerédi ([7]) that for p =, the limit probability for G(, p) to cotai a Hamilto cycle equals
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationAn exact result for hypergraphs and upper bounds for the Turán density of K r r+1
A exact result for hypergraphs ad upper bouds for the Turá desity of K r r+1 Liyua Lu Departmet of Mathematics Uiversity of outh Carolia Columbia, C 908 Yi Zhao Departmet of Mathematics ad tatistics Georgia
More informationMa/CS 6b Class 19: Extremal Graph Theory
/9/05 Ma/CS 6b Class 9: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationV low. e H i. V high
ON SIZE RAMSEY NUMBERS OF GRAPHS WITH BOUNDED DEGREE VOJT ECH R ODL AND ENDRE SZEMER EDI Abstract. Aswerig a questio of J. Beck [B2], we prove that there exists a graph G o vertices with maximum degree
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More informationThe random version of Dvoretzky s theorem in l n
The radom versio of Dvoretzky s theorem i l Gideo Schechtma Abstract We show that with high probability a sectio of the l ball of dimesio k cε log c > 0 a uiversal costat) is ε close to a multiple of the
More informationModel Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions
Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical,
More informationOn Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
O Algorithm for the Miimum Spaig Trees Problem with Diameter Bouded Below Edward Kh. Gimadi 1,2, Alexey M. Istomi 1, ad Ekateria Yu. Shi 2 1 Sobolev Istitute of Mathematics, 4 Acad. Koptyug aveue, 630090
More informationDense H-free graphs are almost (χ(h) 1)-partite
Dese H-free graphs are almost χh) 1)-partite Peter Alle arxiv:0907.815v1 [math.co] 22 Jul 2009 July 22, 2009 Abstract By usig the Szemerédi Regularity Lemma [9], Alo ad Sudakov [1] recetly exteded the
More informationEDGE-COLORINGS AVOIDING RAINBOW STARS
EDGE-COLORINGS AVOIDING RAINBOW STARS CARLOS HOPPEN, HANNO LEFMANN, KNUT ODERMANN, AND JULIANA SANCHES Abstract. We cosider a extremal problem motivated by a paper of Balogh [J. Balogh, A remark o the
More informationA note on log-concave random graphs
A ote o log-cocave radom graphs Ala Frieze ad Tomasz Tocz Departmet of Mathematical Scieces, Caregie Mello Uiversity, Pittsburgh PA53, USA Jue, 08 Abstract We establish a threshold for the coectivity of
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationBalanced coloring of bipartite graphs
Balaced colorig of bipartite graphs Uriel Feige Shimo Koga Departmet of Computer Sciece ad Applied Mathematics Weizma Istitute, Rehovot 76100, Israel uriel.feige@weizma.ac.il Jue 16, 009 Abstract Give
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationLecture #20. n ( x p i )1/p = max
COMPSCI 632: Approximatio Algorithms November 8, 2017 Lecturer: Debmalya Paigrahi Lecture #20 Scribe: Yua Deg 1 Overview Today, we cotiue to discuss about metric embeddigs techique. Specifically, we apply
More informationCHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS
22 CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 2.1 INTRODUCTION Various types of domiatio have bee studied by several authors ad more tha 75 models of domiatio are listed i the appedix
More informationIndependence number of graphs with a prescribed number of cliques
Idepedece umber of graphs with a prescribed umber of cliques Tom Bohma Dhruv Mubayi Abstract We cosider the followig problem posed by Erdős i 1962. Suppose that G is a -vertex graph where the umber of
More informationSolutions for the Exam 9 January 2012
Mastermath ad LNMB Course: Discrete Optimizatio Solutios for the Exam 9 Jauary 2012 Utrecht Uiversity, Educatorium, 15:15 18:15 The examiatio lasts 3 hours. Gradig will be doe before Jauary 23, 2012. Studets
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationLecture 4: April 10, 2013
TTIC/CMSC 1150 Mathematical Toolkit Sprig 01 Madhur Tulsiai Lecture 4: April 10, 01 Scribe: Haris Agelidakis 1 Chebyshev s Iequality recap I the previous lecture, we used Chebyshev s iequality to get a
More informationLecture 9: Expanders Part 2, Extractors
Lecture 9: Expaders Part, Extractors Topics i Complexity Theory ad Pseudoradomess Sprig 013 Rutgers Uiversity Swastik Kopparty Scribes: Jaso Perry, Joh Kim I this lecture, we will discuss further the pseudoradomess
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationBI-INDUCED SUBGRAPHS AND STABILITY NUMBER *
Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationLecture 2 Long paths in random graphs
Lecture Log paths i radom graphs 1 Itroductio I this lecture we treat the appearace of log paths ad cycles i sparse radom graphs. will wor with the probability space G(, p) of biomial radom graphs, aalogous
More informationAlliance Partition Number in Graphs
Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval
More informationA Hypergraph Extension. Bipartite Turán Problem
A Hypergraph Extesio of the Bipartite Turá Problem Dhruv Mubayi 1 Jacques Verstraëte Abstract. Let t, be itegers with t. For t, we prove that i ay family of at least t 4( ) triples from a -elemet set X,
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationOnline hypergraph matching: hiring teams of secretaries
Olie hypergraph matchig: hirig teams of secretaries Rafael M. Frogillo Advisor: Robert Kleiberg May 29, 2008 Itroductio The goal of this paper is to fid a competitive algorithm for the followig problem.
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More informationWeakly Connected Closed Geodetic Numbers of Graphs
Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationDirac s theorem for random graphs
Dirac s theorem for radom graphs Choogbum Lee Bey Sudakov Abstract A classical theorem of Dirac from 1952 asserts that every graph o vertices with miimum degree at least /2 is Hamiltoia. I this paper we
More information4.1 SIGMA NOTATION AND RIEMANN SUMS
.1 Sigma Notatio ad Riema Sums Cotemporary Calculus 1.1 SIGMA NOTATION AND RIEMANN SUMS Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each
More informationREGRESSION WITH QUADRATIC LOSS
REGRESSION WITH QUADRATIC LOSS MAXIM RAGINSKY Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X, Y ), where, as before, X is a R d
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationDavenport-Schinzel Sequences and their Geometric Applications
Advaced Computatioal Geometry Sprig 2004 Daveport-Schizel Sequeces ad their Geometric Applicatios Prof. Joseph Mitchell Scribe: Mohit Gupta 1 Overview I this lecture, we itroduce the cocept of Daveport-Schizel
More informationRegression with quadratic loss
Regressio with quadratic loss Maxim Ragisky October 13, 2015 Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X,Y, where, as before,
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationPartitioning random graphs into monochromatic components
Partitioig radom graphs ito moochromatic compoets arxiv:1509.09168v4 [math.co] 15 Feb 2017 Deepak Bal Departmet of Mathematical Scieces Motclair State Uiversity Motclair, New Jersey; U.S.A. deepak.bal@motclair.edu
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationConnected Balanced Subgraphs in Random Regular Multigraphs Under the Configuration Model
Coected Balaced Subgraphs i Radom Regular Multigraphs Uder the Cofiguratio Model Liyua Lu Austi Mohr László Székely Departmet of Mathematics Uiversity of South Carolia 1523 Greee Street, Columbia, SC 29208
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationLecture 5: April 17, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 5: April 7, 203 Scribe: Somaye Hashemifar Cheroff bouds recap We recall the Cheroff/Hoeffdig bouds we derived i the last lecture idepedet
More informationThe t-tone chromatic number of random graphs
The t-toe chromatic umber of radom graphs Deepak Bal Patrick Beett Adrzej Dudek Ala Frieze March 6, 013 Abstract A proper -toe k-colorig of a graph is a labelig of the vertices with elemets from ( [k]
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationExpected Norms of Zero-One Polynomials
DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Caad. Math. Bull. Vol. XX (Y, ZZZZ pp. 0 0 Expected Norms of Zero-Oe Polyomials Peter Borwei, Kwok-Kwog Stephe Choi, ad Idris Mercer
More informationLecture 3: August 31
36-705: Itermediate Statistics Fall 018 Lecturer: Siva Balakrisha Lecture 3: August 31 This lecture will be mostly a summary of other useful expoetial tail bouds We will ot prove ay of these i lecture,
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationGroup divisible designs GDD(n, n, n, 1; λ 1,λ 2 )
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1) (2017), Pages 18 28 Group divisible desigs GDD(,,, 1; λ 1,λ 2 ) Atthakor Sakda Chariya Uiyyasathia Departmet of Mathematics ad Computer Sciece Faculty
More informationLecture 10 October Minimaxity and least favorable prior sequences
STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationFast Strategies In Maker-Breaker Games Played on Random Boards
Fast Strategies I Maker-Breaker Games Played o Radom Boards Deis Clemes Asaf Ferber Michael Krivelevich Aita Liebeau March 15, 2012 Abstract I this paper we aalyze classical Maker-Breaker games played
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationWeight Distribution in Matching Games
Faculty of Electrical Egieerig, Mathematics & Computer Sciece Weight Distributio i Matchig Games Frits Hof Idividual research assigmet for course program Oderzoek va wiskude i master Sciece Educatio ad
More informationLECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS
LECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS I the previous sectio we used the techique of adjoiig cells i order to costruct CW approximatios for arbitrary spaces Here we will see that the same techique
More informationSimple Polygons of Maximum Perimeter Contained in a Unit Disk
Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationSpectral Partitioning in the Planted Partition Model
Spectral Graph Theory Lecture 21 Spectral Partitioig i the Plated Partitio Model Daiel A. Spielma November 11, 2009 21.1 Itroductio I this lecture, we will perform a crude aalysis of the performace of
More informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationCitation for the original published paper (version of record): N.B. When citing this work, cite the original published paper.
http://www.diva-portal.org This is the published versio of a paper published i The Electroic Joural of Combiatorics. Citatio for the origial published paper (versio of record: Falgas-Ravry, V., Lo, A.
More informationMath778P Homework 2 Solution
Math778P Homework Solutio Choose ay 5 problems to solve. 1. Let S = X i where X 1,..., X are idepedet uiform { 1, 1} radom variables. Prove that E( S = 1 ( 1 1 Proof by Day Rorabaugh: Let S = X i where
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationAlmost intersecting families of sets
Almost itersectig families of sets Dáiel Gerber a Natha Lemos b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hugaria Academy of Scieces, Alfréd Réyi Istitute of Mathematics, P.O.B. 17, Budapest H-1364,
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationSOME GENERALIZATIONS OF OLIVIER S THEOREM
SOME GENERALIZATIONS OF OLIVIER S THEOREM Alai Faisat, Sait-Étiee, Georges Grekos, Sait-Étiee, Ladislav Mišík Ostrava (Received Jauary 27, 2006) Abstract. Let a be a coverget series of positive real umbers.
More information