Ramsey numbers of sparse hypergraphs
|
|
- Collin Richards
- 6 years ago
- Views:
Transcription
1 Ramsey numbers of sparse hypergraphs David Conon Jacob Fox Benny Sudakov Abstract We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree has Ramsey number at most c(, k)n, for an appropriate constant c(, k). This resut was recenty proved by severa authors, but those proofs are a based on appications of the hypergraph reguarity method. Here we give a much simper, sef-contained proof which uses new techniques deveoped recenty by the authors together with an argument of Kostochka and Röd. Moreover, our method demonstrates that, for k 4, c(, k) where the tower is of height k and the constant c depends on k. It significanty improves on the Ackermann-type upper bound that arises from the reguarity proofs, and we present a construction which shows that, at east in certain cases, this bound is not far from best possibe. Our methods aso aow us to prove quite sharp resuts on the Ramsey number of hypergraphs with at most m edges. c, 1 Introduction For a graph H, the Ramsey number r(h) is the east positive integer N such that, in every twocoouring of the edges of compete graph K N on N vertices, there is a monochromatic copy of H. Ramsey s theorem states that r(h) exists for every graph H. A cassica resut of Erdős and Szekeres, which is a quantitative version of Ramsey s theorem, impies that r(k k ) 2 2k for every positive integer k. Erdős showed using probabiistic arguments that r(k k ) > 2 k/2 for k > 2. Over the ast sixty years, there have been severa improvements on these bounds (see, e.g., [4]). However, despite efforts by various researchers, the constant factors in the above exponents remain the same. Determining or estimating Ramsey numbers is one of the centra probem in combinatorics, see the book Ramsey theory [17] for detais. Besides the compete graph, the next most cassica topic in this area concerns the Ramsey numbers of sparse graphs, i.e., graphs with certain upper bound constraints on the degrees of the vertices. The study of these Ramsey numbers was initiated by Burr and Erdős in 1975, and this topic has since paced a centra roe in graph Ramsey theory. Burr and Erdős conjectured, and it was proved by Chváta, Röd, Szemerédi and Trotter [3], that for every graph G on n vertices and maximum degree, r(g) c( )n. St John s Coege, Cambridge, United Kingdom. E-mai: D.Conon@dpmms.cam.ac.uk Department of Mathematics, Princeton, Princeton, NJ. Emai: jacobfox@math.princeton.edu. Research supported by an NSF Graduate Research Feowship and a Princeton Centennia Feowship. Department of Mathematics, UCLA, Los Angees, CA and Institute for Advanced Study, Princeton, NJ. Emai: bsudakov@math.uca.edu. Research supported in part by NSF CAREER award DMS , NSF grants DMS and DMS , by a USA-Israei BSF grant, and by the State of New Jersey. 1
2 Their proof of this theorem is a cassic appication of Szemerédi s beautifu reguarity emma. However, the use of this emma makes the upper bound on c( ) grow as a tower of 2s with height proportiona to. Eaton [8] used a variant of the reguarity emma to obtain the upper bound c( ) 2 2c for some fixed c. A nove approach of Graham, Röd, Rucinski [15] that did not use any form of the reguarity emma gives the upper bound c( ) 2 c og2 for some fixed c. In the other direction, in [16] they proved that there is a positive constant c such that, for every 2 and n + 1, there is a bipartite graph G with n vertices and maximum degree at most satisfying r(g) 2 c n. Recenty, the authors [5], [12] cosed the gap for bipartite graphs by showing that, for every bipartite graph G with n vertices and maximum degree, r(g) 2 c n for some fixed c. A hypergraph H = (V, E) consists of a vertex set V and an edge set E, which is a coection of subsets of V. A hypergraph is k-uniform if each edge has exacty k vertices. The Ramsey number r(h) of a k-uniform hypergraph H is the smaest number N such that, in any 2-coouring of the edges of the compete k-uniform hypergraph K (k) N, there is guaranteed to be a monochromatic copy of H. The existence of these numbers was proven by Ramsey [24], but no proper consideration of the vaues of these numbers was made unti the fifties, when Erdős and Rado [11]. To understand the growth of Ramsey numbers for hypergraphs, it is usefu to introduce the tower function t i (x), which is defined by t 1 (x) = x and t i+1 (x) = 2 ti(x), i.e., t i+1 (x) = where the number of 2s in the tower is i. Erdős and Rado showed that for H being the compete k-uniform hypergraph K (k), r(h) t k (c), where the constant c depends on k. In the other direction, Erdős and Hajna (see [17]) proved that for H = K (k), r(h) t k 1 (c 2 ), where the constant c depends on k. One can naturay try to extend the sparse graph Ramsey resuts to hypergraphs. Kostochka and Röd [20] showed that for every ɛ > 0, the Ramsey number of any k-uniform hypergraph H with n vertices and maximum degree satisfies r(h) c(, k, ɛ)n 1+ɛ, where c(, k, ɛ) ony depends on, k, and ɛ. Since the first proof of the sparse graph Ramsey theorem used Szemerédi s reguarity emma, it was therefore natura to expect that, given the recent advances in deveoping a hypergraph reguarity method [14, 25, 23], inear bounds might as we be provabe for hypergraphs. Such a program was indeed recenty pursued by severa authors (Cooey, Fountouakis, Kühn, and Osthus [6, 7]; Nage, Osen, Röd, and Schacht [22]; Ishigami [18]), with the resut that we now have the foowing theorem: Theorem 1 Let and k be positive integers. Then there exists a constant c(, k) such that the Ramsey number of any k-uniform hypergraph H with n vertices and maximum degree satisfies x r(h) c(, k)n. In this paper we wi give a short proof of this theorem, which is much simper and avoids a use of the reguarity emma, buiding instead on techniques deveoped recenty by Conon [5] and by Fox and Sudakov [12] in order to study embeddings of sparse bipartite graphs in dense graphs., 2
3 The first main resut of this paper is an extension of this work from graphs to hypergraphs. An - uniform hypergraph is -partite if there is a partition of the vertex set into parts such that each edge has exacty one vertex in each part. We prove the foowing Turán-type resut for -uniform -partite hypergraphs: Theorem 2 There exists a constant c = c() such that if F is an -uniform -partite hypergraph with n vertices and maximum degree and G is an -uniform -partite hypergraph with parts of size N (ɛ/2) c 1 n and at east ɛn edges, then G contains a copy of F. Then, in section 3, we wi prove Theorem 1 by appying an argument of Kostochka and Röd which shows that the Ramsey probem for genera hypergraphs may be reduced to an appication of the Turán theorem in the -uniform -partite case. This argument combined with our Theorem 2 shows that, for k 4 and k-uniform hypergraph H with n vertices and maximum degree, r(h) t k (c )n, where the constant c depends on k. For k = 3, the proof shows that r(h) t 3 (c og )n. This is ceary much better than the Ackermann-type upper bound that arises from the reguarity proofs. The tower-type upper bound cannot be avoided as demonstrated by the ower bound of Erdős and Hajna for the Ramsey number of the compete k-uniform hypergraph on n vertices. This hypergraph has maximum degree = ( ) n 1 k 1 and Ramsey number at east tk 1 (c 2 k 1 )n, where the constant c depends on k. For k-uniform hypergraphs H 1,..., H q, the muticoour Ramsey number r(h 1,..., H q ) is the minimum N such that, in any q-coouring of the edges of the compete k-uniform hypergraph K (k) N with coours 1,..., q, there is a monochromatic copy of H i in coour i for some i, 1 i q. The proof of Theorem 1 presented here extends in a straightforward manner to the muticoour generaisation, which states that for a positive integers, k, and q, there exists a constant c(, k, q) such that, if H 1,..., H q are k-uniform hypergraphs each with n vertices and maximum degree, then r(h 1,..., H q ) c(, k, q)n. The proof demonstrates that may take c(, k, q) t k (c ) for k 4 and c(, 3, q) t 3 (c og ), where the constant c depends on k and q. In the other direction, in Section 4 we construct, for each sufficienty arge, a 3-uniform hypergraph H with maximum degree at most for which the 4-coour Ramsey number of H satisfies r(h, H, H, H) t 3 (c )n, where n is the number of vertices of H. This exampe shows that our upper bound for hypergraph Ramsey numbers is probaby cose to being best possibe. The same exampe aso shows that there is a 3-uniform hypergraph H with m edges for which the 4-coour Ramsey number of H is at east t 3 (c m). On the other hand, one can easiy deduce from the proof of Theorem 1 that for any k-uniform hypegraph H with m edges, we have that the q-coour Ramsey number of H satisfies r(h,, H) t 3 (c m og m) for k = 3, and r(h,, H) t k (c m) for k 4, where c depends on k and q. 2 A Turán theorem for -uniform -partite hypergraphs The foowing is a generaisation to hypergraphs of a emma which has appeared increasingy in the iterature on Ramsey theory, whose proof uses a probabiistic argument known as dependent random choice. Eary versions of this technique were deveoped in the papers [13], [19], [26]. Later, variants 3
4 were discovered and appied to various Ramsey and density-type probems (see, e.g., [21, 1, 27, 20, 12, 5]). We define the weight w(s) of a set S of edges in a hypergraph to be the size of the union of these edges. Lemma 1 Suppose s, are positive integers, ɛ, β > 0, and G r = (V 1,, V r ; E) is an r-uniform r-partite hypergraph with V 1 = V 2 = = V r = N and at east ɛn r edges. Then there exists an (r 1)-uniform (r 1)-partite hypergraph G r 1 on the vertex sets V 2,, V r which has at east ɛs 2 N r 1 edges and such that for each nonnegative integer w (r 1), there are at most 4r ɛ s β s w r r w N w dangerous sets of edges of G r 1 with weight w, where a set S of edges of G r 1 is dangerous if S and the number of vertices v V 1 such that for every edge e S, e + v G r is ess than βn. Proof: Let C be the compete (r 1)-uniform (r 1)-partite hypergraph on the vertex sets V 2,, V r. For any edge e in C, et d(e) be the degree of e in G r, i.e., the number of vertices in V 1 such that e + v G r. Let T be a set of s random vertices of V 1, chosen uniformy with repetitions. Let A be the set of edges in C which are common neighbours of the vertices of T, i.e., an edge e of C is in A if e + v is an edge of G r for a v T. Let X denote the cardinaity of A. We wi show that with positive probabiity, the set A wi be the edge set of a hypergraph G r 1 on vertex sets V 2,..., V r with the desired properties. By inearity of expectation and by convexity of f(z) = z s, ( ) d(e) s E[X] = P[e I] = e C e C ( N r 1 e C d(e) N r 1 N s ) s N N r 1 (ɛn) s N s = ɛ s N r 1. Note that X N r 1 since C has N r 1 edges. Letting p denote the probabiity that X E[X]/2, we have E[X] (1 p)e[x]/2 + pn r 1 E[X]/2 + pn r 1. So the probabiity p that X E[X]/2 ɛ s N r 1 /2 satisfies p E[X] ɛ s /2. 2N r 1 The number of subsets S of V 2... V r of size w is ( ) (r 1)N w. For a given w-set S, the number of coections {e 1,..., e t } of size t with e i = r 1, and e i S for 1 i t is ( ( r 1) w ) t. Hence, summing over a nonnegative t, the number of sets of edges of C with weight w and size at most is at most t=0 (( w r 1 ))( ) (r 1)N w r (rn) w = w r r w N w, t w Let Y w denote the random variabe counting the number of dangerous sets S of edges of G r 1 with weight w. We next give an upper bound on ) E[Y w ]. For a given set S of edges of C, the probabiity s, that S is a subset of edges of G r 1 is where N(S) denotes the set of vertices v V1 with ( N(S) N v + e an edge of G r for a e S. So if S satisfies N(S) < βn, then the probabiity that S is a subset of edges of G r 1 is ess than β s. By inearity of expectation, we have E[Y w ] < β s w r r w N w. Let α = 4r ɛ s. Since Y w is a nonnegative random variabe, Markov s inequaity impies that P (Y w αe[y w ]) 1 α. Hence, the probabiity that there is a nonnegative integer w (r 1) 4
5 with Y w αβ s w r r w N w is at most r /α = ɛ s /4. Since the probabiity that X ɛs 2 N r 1 is at east ɛ s /2, we can satisfy the conditions of the emma with probabiity at east ɛ s /4. By simpy iterating the previous emma 1 times, we obtain the foowing coroary. Coroary 1 Suppose s, are positive integers, ɛ, β > 0, and G = (V 1,, V ; E ) is an -uniform -partite hypergraph with V 1 = V 2 = = V = N and at east ɛn edges. Let δ = ɛ and δ r 1 = δr/2 s for 2 r. Then, for 1 r 1, there are r-uniform r-partite hypergraphs G r = (V r+1,..., V, E r ) with the foowing properties: 1. G r has at east δ r N r edges for 1 r, and 2. for 2 r and each nonnegative integer w (r 1), there are at most 4r δr s β s w r r w N w dangerous sets of G r 1 with weight w, where a set S of edges of G r 1 is dangerous if S and the number of vertices v V r+1 such that for every edge e S, e + v G r is ess than βn. This is a the preparation we need before proving our main contribution, Theorem 2. For the proof, we wi use Coroary 1 and then show how to embed F into G. The atter part is cosey reated to the many embedding resuts proven by Fox and Sudakov in [12]. We wi actuay prove the foowing more precise version of Theorem 2: Theorem 3 Let 3, F be an -uniform -partite hypergraph, on vertex sets W 1,, W, with at most n vertices and maximum degree. Let G be an -uniform -partite graph, on vertex sets V 1,, V with V 1 = = V = N, with at east ɛn edges. Then, provided that N (ɛ/2) (2 ) 1 n, G contains a copy of F. Proof: We appy Coroary 1 with s = 2, δ = ɛ, δ i 1 = δi s /2 for 2 i, and β = 2 (ɛ/2)(2 ) 1 to get hypergraphs G 1,..., G 1. It is easy to check by induction on i that δ i = 2 (si 1)/(s 1) ɛ si, so and δ 1 N βn 2n. δ 1 = 2 (s 1 1)/(s 1) ɛ s 1 2 (ɛ/2) (2 ) 1 = β We now construct an -unform bad hypergraph B with vertex set V 1... V where each edge of B has exacty vertices in each V i. A set T V 1... V which contains exacty vertices in each V i is an edge of B if and ony if there is a dangerous set S of edges of G r for some r, 1 r 1, such that the union of the edges of S is a subset of T. In other words, an edge of B is just an extension of the union of the edges of a dangerous set. For a particuar dangerous set S of edges with weight w in some G r, the number of edges of B that are extensions of the union of the edges in S is at most N w since there are at most N ways to pick each of the w remaining vertices that make up an edge. Summing over a r and w, and using the fact that 3 and δ s 2 = 2δ 1 2β, the number of edges of B is at most r=2 ( 1) w=0 4r δ s r β s w r r w N 2 2 β s 1 ( ) N = ( 2 ) β 1 β N 2 1+3( )2 β 1 β N 2 1+3( )2 2 (1 (2 ) 1)( 1) β N ( ) β ( ) N 2 4( )2 β N. 4 5
6 Ca a set U V 1... V with at most vertices in each V i bad if there are at east ( ) β U ( ) N 4 U edges of B that contain U; otherwise ca U good. Note that the above cacuation on the number of edges of B demonstrates that the empty set is good. We next prove the foowing important caim. Caim 1 If S is a dangerous set of edges in G r for some r, 1 r 1, and U is a good set, then the union of the edges in S is not a subset of U. Proof: Suppose for contradiction that the union of the edges in S is a subset of U. The number of extensions of U to a set which contains exacty vertices in each V i is i=1 ( ) N Vi U V i U since we can pick for each i any V i U vertices of V i \ U to extend U. By definition, a of these sets are edges in B. Using the simpe fact that if x 1,..., x are nonnegative integers then i=1 x i! ( i=1 x i)!, it is straightforward to check that i=1 ( ) N Vi U V i U (N/2) U ( V i U )! 1 i=1 ( ) β U ( ) N, 4 U ( ) 1 U ( ) N 2 U which contradicts U being good. Given a good set U with V i U < and v V i \ U, we say v is bad with respect to U if U {v} is bad. Let B U denote the set of vertices that are bad with respect to U. We wi show that for U good we have B U βn 4. Indeed, suppose B U > βn 4. Then the number of edges of B containing U is at east ( ) B U β U 1 ( ) ( ) N β U ( ) N >, U 4 U 1 4 U contradicting the fact that U is good. Fix a abeing {v 1,, v n } of the vertices of F such that a vertices in W i+1 precede a those in W i for a i = 1,, 1. For each i, et L i = {v 1,, v i }. For each vertex v h, the trace neighbourhood N(v h ) is the set of vertices v m with m < h that are in an edge of F with v m. Note that N(v h ) contains at most vertices in each W r since F has maximum degree. We wi find an embedding f of the vertices of F such that f(w r ) V r for 1 r and for each i N, 1. f(n(v) L i ) is good for each vertex v of F, and 2. f(e L i ) is an edge of G r for each edge e of F, where r = e L i. 6
7 The proof wi be compete once we find such an embedding f since, for each edge e of F, f(e L n ) = f(e) is an edge of G, so f provides an embedding of F in G. The embedding wi be constructed one vertex at a time, in increasing order of subscript, so the proof wi be by induction on i. As noted earier, the empty set is good, so our base case i = 0 is satisfied. Suppose then that at step i, we have found an embedding f of v 1,..., v i such that 1. for each vertex v of F, f(n(v) L i ) is good, and 2. for each edge e of F, f(e L i ) is an edge of G r, where r = e L i. Let j be such that v i+1 W j. Let e 1,..., e d denote the edges of F that contain v i+1 and e 1,..., e d denote the truncations of e 1,..., e d by deeting a j vertices from each e t that are in some W h with h j. Each e t consists of one vertex from each W h with h > j. Aso, d since F has maximum degree. Since F has maximum degree, there are ess than vertices v for which v i+1 N(v). For each β such v, f(n(v) L i ) is good, so there are at most 4 N vertices w in V j for which f(n(v) L i ) w is bad. Adding over a such v, we concude that there are at most β 4 N bad vertices in a associated with v i+1. Suppose we are sti embedding vertices of W in V. Since the edge set of G 1 is just a subset of V whose size by Coroary 1 is at east δ 1 N = βn, then we can choose any of these at east βn vertices other than f(v 1 ),..., f(v i ) for f(v i+1 ) to satisfy the second of the two desired properties for f(v i+1 ). We see that there are at east βn i β 4 N > 3βN 4 n > 0 vertices to choose from for f(v i+1 ) to satisfy both of the desired properties. If, now, we have chosen a of the vertices in W,, W j+1 and we are trying to embed vertex v i+1 in W j (we may have aready embedded other vertices in W j ), we can do so. To see this, by the induction hypothesis, f(n(v i+1 ) L i ) = f(n(v i+1 )) = d t=1 f(e t) is good. By Caim 1, this impies that the set {f(e 1 ),..., f(e d )} of edges of G j is not bad, i.e., there are at east βn vertices v V j such that f(e t) v is an edge of G j+1 for 1 t d. Therefore, since there are at most β 4 N bad vertices associated with v i+1 and we have aready chosen f(v 1 ),..., f(v i ), we have at east 3 4 βn i > 3 4 βn n > 0 choices for f(v i+1), which competes the proof. 3 The Ramsey theorem We are now ready to prove Theorem 1 in the foowing form: Theorem 4 Let and k 3 be positive integers. Then the Ramsey number of any k-uniform hypergraph H with n vertices and maximum degree satisfies where r k () = r(k (k) ). r(h) r k (k ) (2k 2 ) k n, Proof: We use the argument of Kostochka and Röd [20] together with Theorem 3. Let = (k 1) + 1. Suppose we have a red-bue coouring of the compete k-uniform hypergraph on N vertices. 7
8 Let G be the hypergraph consisting of a the red edges and et r k () be the Ramsey number of the hypergraph K (k). Then, in each subset of the vertices of size r k (), there is at east one monochromatic K (k). Counting over a such sets and dividing out by possibe mutipe counts we see that we have at east ( N ) r k () ) N r k () ( N r k () monochromatic K (k). Therefore, either G or its compement G contains at east N /2r k () ciques K (k). We wi suppose that it is G. Now we pass instead to considering the -uniform hypergraph G (), the edges of which are exacty those -tupes which form compete K (k) in G. This hypergraph has at east N /2r k () edges. Partition its N! vertex set randomy into parts V 1,, V of equa size N/. The tota number of partitions is (N )! (N/)! and, for any given edge e, there are! partitions such that each vertex of this edge is in a (N/ 1)! different part of the partition. Therefore, the expected number of edges with one vertex in each set of the random partition is at east ( / ) e(g () (N )! N! )! (N/ 1)! (N/)! N 2r k ()! (N )! (N/)! (N/ 1)! N! N! 2r k () =! ( ) N 2r k (). Now choose such a partition and et Ĝ() be the -uniform -partite subhypergraph of G () consisting of those edges of G () which have one edge in each partite set. Note that Ĝ() has N/ vertices in each part and at east ɛ ( ) N edges, where ɛ =!. 2r k () Now we extend hypergraph H to an -uniform -partite hypergraph H (). We first note that the vertices of H can be partitioned into subsets A 1,..., A such that each edge of H has at most one vertex in each part. This is equivaent to saying that the graph H with the same vertex set as H and with two edges adjacent if they ie in an edge of H has chromatic number at most. Since H has maximum degree at most (k 1), it has chromatic number at most (k 1) + 1 =. For each edge e of H, we add one auxiiary vertex to each A i which is disjoint from e (in tota k vertices). Note that the maximum degree of H () remains. The tota number of auxiiary vertices added is at most n k ( k) < ( 1)n since there are k auxiiary vertices for each edge and the tota number of edges of H is at most n k. Hence, H() has ess than 2 n vertices. Appying Theorem 3 with F = H (), G = Ĝ(), and ɛ =! we see that, provided 2r k () N (ɛ/2) (2 ) 1 2 n, Ĝ () contains a copy of H (). But now, by the construction of H (), this impies that every edge in H is contained inside an edge of Ĝ(). But Ĝ() was chosen in such a way that every k-tupe within any edge of Ĝ() is an edge in G. Therefore G contains a copy of H, so we are done. As mentioned in the introduction, the proof of Theorem 1 presented here extends in a straightforward manner to the foowing muticoour generaisation. Theorem 5 For a positive integers, k, and q, there exists a constant c(, k, q) such that, if H 1,..., H q are k-uniform hypergraphs each with n vertices and maximum degree, then r(h 1,..., H q ) c(, k, q)n. 8
9 The ony difference in the proof is in Theorem 4, where we repace r k () by r k (; q), the q-coour Ramsey number for the compete k-uniform hypergraph on vertices. Erdős and Rado [11] showed that r k (; q) t k (c), where the constant c depends on k and q. We therefore may take c(, k, q) t k (c ) for k 4 and c(, 3, q) t 3 (c og ), where the constant c depends on k and q. Remark: The strong chromatic number of a hypergraph H is the minimum number of coors required to coour the vertices of H so that each edge of H has no repeated coour. The proof of Theorem 4 demonstrates that if H is a k-uniform hypergraph with n vertices, maximum degree, and strong chromatic number, then the q-coour Ramsey number of H satisfies r(h,, H) r k (; q) (2 ). Indeed, in the proof of Theorem 4, we ony used the fact that the vertices of H can be partitioned into parts such that every edge has at most one vertex in each part. 4 Lower bound construction The foowing theorem demonstrates that our upper bound for hypergraph Ramsey numbers proved in the previous section is in some cases cose to best possibe. Theorem 6 There is c > 0 such that for each sufficienty arge, there is a 3-uniform hypergraph H with maximum degree at most for which the 4-coour Ramsey number of H satisfies where n is the number of vertices of H. r(h, H, H, H) 2 2c n, Proof: Our proof uses the same 4-edge-coouring of the compete 3-uniform hypergraph that was constructed by Erdős and Hajna (see, e.g., [17]). Not ony does this coouring have no arge monochromatic compete 3-uniform hypergraph, but we show it aso does not have any monochromatic copies of a much sparser 3-uniform hypergraph H. Let n 4 be even, m = 2 n/4, and suppose the edges of the compete graph K m are cooured red or bue in such a way that neither coour contains a monochromatic copy of the graph K n/2. Such an edge-coouring exists by the ower bound of Erdős (see [17]) on the Ramsey number of the compete graph. Let V = {v 1,, v n } be a set of vertices and et H be the 3-uniform hypergraph on V whose edge set is given by {v i, v i+1, v j } for a 1 i, j n. (Note that when i = n, we consider i + 1 to be equa to 1.) It is straightforward to check that every vertex in H has degree 3n. We are going to define a 4-coouring of the compete 3-uniform hypergraph on the set T = {(γ 1,, γ m ) : γ i = 0 or 1} in such a way that there is no monochromatic copy of H. Note that then we wi be done, since T has size 2 m 2 2n/4 whie H has maximum degree 3n. To define our coouring, we need some definitions: 9
10 If ɛ = (γ 1,, γ m ), ɛ = (γ 1,, γ m) and ɛ ɛ, define δ(ɛ, ɛ ) = max{i : γ i γ i}, that is, δ(ɛ, ɛ ) is the argest coordinate at which they differ. We can now define an ordering on T by ɛ < ɛ if γ i = 0, γ i = 1, ɛ < ɛ if γ i = 1, γ i = 0. Another way of ooking at this ordering is to assign to each ɛ the number b(ɛ) = m i=1 γ i2 i 1. The ordering then says simpy that ɛ < ɛ iff b(ɛ) < b(ɛ ). It is important to note the foowing two properties of the function δ: (a) if ɛ 1 < ɛ 2 < ɛ 3, then δ(ɛ 1, ɛ 2 ) δ(ɛ 2, ɛ 3 ); (b) if ɛ 1 < ɛ 2 < < ɛ r, then δ(ɛ 1, ɛ r ) = max 1 i r 1 δ(ɛ i, ɛ i+1 ). Now we are ready to define our coouring of the compete 3-uniform hypergraph τ on vertex set T. To begin, suppose that {ɛ 1, ɛ 2, ɛ 3 } with ɛ 1 < ɛ 2 < ɛ 3 is an edge in τ. Write δ 1 = δ(ɛ 1, ɛ 2 ), δ 2 = δ(ɛ 2, ɛ 3 ). Then we coour as foows: C 1, if {δ 1, δ 2 } is red and δ 1 < δ 2 ; C 2, if {δ 1, δ 2 } is red and δ 1 > δ 2 ; C 3, if {δ 1, δ 2 } is bue and δ 1 < δ 2 ; C 4, if {δ 1, δ 2 } is bue and δ 1 > δ 2. Now, et S = {ɛ 1,, ɛ n } < be an ordered n-tupe within τ and suppose that there is a copy of H on S which is cooured by C 1. Suppose that the natura cyce {v 1,, v n } associated with H occurs as {ɛ π(1),, ɛ π(n) } where π is a permutation of 1,, n. For each i, 1 i n, et φ(i) = max(π(i), π(i + 1)) and ψ(i) = min(π(i), π(i + 1)). We caim that δ φ(i) 1 = δ(ɛ φ(i) 1, ɛ φ(i) ) must be arger than δ j = δ(ɛ j, ɛ j+1 ) for a j < φ(i) 1. First consider the tripe {ɛ ψ(i), ɛ φ(i) 1, ɛ φ(i) } <, which is an edge of the copy of H on S. The coouring C 1 impies that δ φ(i) 1 = δ(ɛ φ(i) 1, ɛ φ(i) ) > δ(ɛ ψ(i), ɛ φ(i) 1 ) = max δ j. ψ(i) j<φ(i) 1 This proves the caim for ψ(i) j < φ(i) 1. Next consider the tripe {ɛ j, ɛ ψ(i), ɛ φ(i) } < with j < ψ(i), which is aso an edge of the copy of H on S. The coouring C 1 impies that δ j δ(ɛ j, ɛ ψ(i) ) < δ(ɛ ψ(i), ɛ φ(i) ) = δ φ(i) 1. This proves the caim in the remaining cases 1 j < φ(i) 1. Consider the set {φ(2i 1)} n/2 i=1, which contains n/2 distinct eements since φ(i) = max(π(2i 1), π(2i)) and these pairs are disjoint. Let j 1,..., j n/2 be a permutation of the odd numbers up to n 1 such that φ(j 1 ) <... < φ(j n/2 ). By the caim in the previous paragraph, we have δ φ(j1 ) 1 < < δ φ(jn/2 ) 1. Consider, for each r < s with r, s {1,, n/2}, the tripe {ɛ ψ(jr), ɛ φ(jr), ɛ φ(js)} <, which is an edge of 10
11 the copy of H on S. Since ψ(j r ) < φ(j r ) < φ(j s ), by property (b) of function δ and the caim above, δ(ɛ ψ(jr), ɛ φ(jr)) = δ φ(jr) 1 and δ(ɛ φ(jr), ɛ φ(js)) = δ φ(js) 1. Therefore, by the definition of C 1 we must have that {δ φ(jr) 1, δ φ(js) 1} is red. Hence we get a cique of size n/2 in our origina coouring. But this cannot happen so we have a contradiction. A other cases foow simiary, so we re done. This resut is cosey reated to another interesting question: what is the maximum of r(h) over a k-uniform hypergraphs with m edges (we assume here that the hypergraphs we consider do not have isoated vertices)? For graphs, this question was posed by Erdős and Graham [10] who conjectured that the Ramsey number of a compete graph is at east the Ramsey number of every graph with the same number of edges. As noted by Erdős [9], this conjecture impies that there is a constant c such that for a graphs G, r(g) 2 c e(g). The best resut in this direction, proven by Aon, Kriveevich and Sudakov [1], is that r(g) 2 c e(g) og e(g). For hypergraphs, one can naturay ask a question simiar to the Erdős-Graham conjecture, i.e, is there a constant c = c(k) such that for every k-uniform hypergraph H, r(h) t k (c k e(h))? The proof of Theorem 6 has the foowing coroary: Coroary 2 There is a positive constant c such that for each positive integer m, there is a 3- uniform hypergraph H with at most m edges such that the 4-coour Ramsey number of H satisfies r(h, H, H, H) 2 2c m. Indeed the 3-uniform hypergraph H constructed in the proof of Theorem 6 has n vertices and ess than n 2 edges, whie r(h, H, H, H) t 3 (n/4) t 3 ( e(h)/4). This coroary demonstrates that the muticoour version of the hypergraph anaogue of the Erdős-Graham conjecture is fase. In the other direction, we prove the foowing theorem: Theorem 7 The q-coour Ramsey number of any k-uniform hypergraph H with m edges satisfies for k 4, and r(h,, H) t k (c m) r(h,, H) t 3 (c m og m) for k = 3, where constant c depends ony on k and q. Theorem 7 foows immediatey from the remark after the proof of Theorem 4, the fact that the maximum degree of H is ceary at most m, and the foowing emma. Lemma 2 Every k-uniform hypergraph H with m edges has strong chromatic number at most k m. Proof: Let H be the graph on the same vertex set as H with two vertices adjacent if they ie in an edge of H. The strong chromatic number of H is ceary equa to the chromatic number of H. The number e(h ) of edges of H is at most ( ) ( k 2 m k m ) ( 2 since each edge of H gives rise to at most k 2) edges ( of H. To finish the proof, note that the chromatic number χ of any graph with t edges satisfies χ ) 2 t because in an optima coouring there shoud be an edge between any two coour casses. 11
12 5 Concusion Throughout this paper we have aimed for simpicity in the exposition. Accordingy, in proving Theorem 2, we have cut some corners to make the proof as pithy as possibe. The resuting constant, c = (2k) k 1, is doubtess far from best possibe, but we beieve that this oss is outweighed by the resuting brevity of exposition. As we noted in the introduction, our Theorem 4 impies that, for k 4, there exists a constant c = c(k) such that, for any graph H on n vertices with maximum degree, r(h) t k (c )n, where the constant c depends ony on k. For k = 3, however, it ony impies that r(h) 2 2c og n, (1) which coud perhaps be improved a itte. It is worth noting aso that for k = 2, the best known bound, proved by Graham, Röd and Ruciński [15] using a very different method is r(h) 2 c og2 n. (2) In ight of the situation for higher k as we as the ower bound constructions for k = 2, 3, the foowing is a natura question: Probem 1 Can the og factors in the highest exponent of the upper bounds (1) and (2) be removed? This probem is certainy difficut in the k = 2 case, but maybe a different extension of the methods of [12] or an appropriate generaisation of the work of Graham, Röd and Ruciński coud resove the k = 3 case. It aso seems ikey to us that the ower bound for this probem is essentiay the same as the upper bound. So we have the foowing open probem: Probem 2 Is it true that for a k and and sufficienty arge n, there exists a k-uniform hypergraph H with maximum degree and n vertices such that r(h) t k (c )n, where c > 0 ony depends on k? References [1] N. Aon, M. Kriveevich, B. Sudakov: Turán numbers of bipartite graphs and reated Ramsey-type questions, Combin. Probab. Comput. 12 (2003), [2] S.A. Burr, P. Erdős: On the magnitude of generaized Ramsey numbers for graphs, in: Infinite and Finite Combinatorics, vo. 1, Cooq. Math. Soc. János Boyai 10 (1975) [3] V. Chvatá, V. Röd, E. Szemerédi, W.T. Trotter Jr.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), [4] D. Conon: A new upper bound for diagona Ramsey numbers, Annas of Mathematics, to appear. [5] D. Conon: Hypergraph Packing and sparse bipartite Ramsey numbers, submitted. [6] O. Cooey, N. Fountouakis, D. Kühn, D. Osthus: 3-uniform hypergraphs of bounded degree have inear Ramsey numbers, to appear in J. Combin. Theory Ser. B. 12
13 [7] O. Cooey, N. Fountouakis, D. Kühn, D. Osthus: Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, submitted. [8] N. Eaton: Ramsey numbers for sparse graphs, Discrete Math. 185 (1998), [9] P. Erdős: On some probems in graph theory, combinatoria anaysis and combinatoria number theory, Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London-New York (1984), [10] P. Erdős, R.L. Graham: On partition theorems for finite graphs, Infinite and Finite Sets (Cooq., Keszthey, 1973: dedicated to P. Erdős on his 60th birthday), Vo. I; Cooq. Math. Soc. János Boyai, Vo.10, North-Hoand, Amsterdam (1975), [11] P. Erdős, R. Rado: Combinatoria theorems on cassifications of subsets of a given set, Proc. London Math. Soc. 3 (1952), [12] J. Fox, B. Sudakov: Density theorems for bipartite graphs and reated Ramsey-type resuts, submitted. [13] W. T. Gowers: A new proof of Szemerédi s theorem for arithmetic progressions of ength four, Geom. Funct. Anaysis 8 (1998), [14] W.T. Gowers: Hypergraph reguarity and the mutidimensiona Szemerédi theorem, to appear in Annas of Math. [15] R.L. Graham, V. Röd, A. Ruciński: On graphs with inear Ramsey numbers, J. Graph Theory 35 (2000), [16] R.L. Graham, V. Röd, A. Ruciński: On bipartite graphs with inear Ramsey numbers, Combinatorica 21 (2001), [17] R.L. Graham, B.L. Rothschid, J.L. Spencer: Ramsey theory, John Wiey & Sons (1980). [18] Y. Ishigami: Linear Ramsey numbers for bounded-degree hypergraphs, preprint. [19] A. V. Kostochka, V. Röd: On graphs with sma Ramsey numbers, J. Graph Theory 37 (2001), [20] A. V. Kostochka, V. Röd: On Ramsey numbers of uniform hypergraphs with given maximum degree, J. Combin. Theory Ser. A 113 (2006), [21] A. V. Kostochka, B. Sudakov: On Ramsey numbers of sparse graphs, Combin. Probab. Comput. 12 (2003), [22] B. Nage, S. Osen, V. Röd, M. Schacht: On the Ramsey number of sparse 3-graphs, preprint. [23] B. Nage, V. Röd, M. Schacht: The counting emma for k-uniform hypergraphs, Random Struct. Agorithms 28 (2006), [24] F.P. Ramsey: On a probem of forma ogic, Proc. London Math. Soc. Ser (1930), [25] V. Röd, J. Skokan: Reguarity emma for k-uniform hypergraphs, Random Struct. Agorithms 25 (2004),
14 [26] B. Sudakov: Few remarks on the Ramsey-Turan-type probems, J. Combinatoria Theory Ser. B 88 (2003), [27] B. Sudakov: Large K r -free subgraphs in K s -free graphs and some other Ramsey-type probems, Random Structures & Agorithms 26 (2005),
Supersaturation for Ramsey-Turán problems
Supersaturation for Ramsey-Turán probems Dhruv Mubayi Vojtĕch Röd Apri 8, 005 Abstract For an -graph G, the Turán number ex(n, G is the maximum number of edges in an n-vertex -graph H containing no copy
More informationMONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES
MONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES ANDRZEJ DUDEK AND ANDRZEJ RUCIŃSKI Abstract. For positive integers k and, a k-uniform hypergraph is caed a oose path of ength, and denoted by
More informationHow many random edges make a dense hypergraph non-2-colorable?
How many random edges make a dense hypergraph non--coorabe? Benny Sudakov Jan Vondrák Abstract We study a mode of random uniform hypergraphs, where a random instance is obtained by adding random edges
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationCo-degree density of hypergraphs
Co-degree density of hypergraphs Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Iinois at Chicago Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationSTABLE GRAPHS BENJAMIN OYE
STABLE GRAPHS BENJAMIN OYE Abstract. In Reguarity Lemmas for Stabe Graphs [1] Maiaris and Sheah appy toos from mode theory to obtain stronger forms of Ramsey's theorem and Szemeredi's reguarity emma for
More informationarxiv: v1 [math.co] 12 May 2013
EMBEDDING CYCLES IN FINITE PLANES FELIX LAZEBNIK, KEITH E. MELLINGER, AND SCAR VEGA arxiv:1305.2646v1 [math.c] 12 May 2013 Abstract. We define and study embeddings of cyces in finite affine and projective
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 information#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG
#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG Guixin Deng Schoo of Mathematica Sciences, Guangxi Teachers Education University, Nanning, P.R.China dengguixin@ive.com Pingzhi Yuan
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationBayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?
Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine
More informationList edge and list total colorings of planar graphs without non-induced 7-cycles
List edge and ist tota coorings of panar graphs without non-induced 7-cyces Aijun Dong, Guizhen Liu, Guojun Li To cite this version: Aijun Dong, Guizhen Liu, Guojun Li. List edge and ist tota coorings
More informationHypergraph Ramsey numbers
Hypergraph Ramsey numbers David Conlon Jacob Fox Benny Sudakov Abstract The Ramsey number r k (s, n is the minimum N such that every red-blue coloring of the k-tuples of an N-element set contains a red
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationHomogeneity properties of subadditive functions
Annaes Mathematicae et Informaticae 32 2005 pp. 89 20. Homogeneity properties of subadditive functions Pá Burai and Árpád Száz Institute of Mathematics, University of Debrecen e-mai: buraip@math.kte.hu
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 informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationare left and right inverses of b, respectively, then: (b b 1 and b 1 = b 1 b 1 id T = b 1 b) b 1 so they are the same! r ) = (b 1 r = id S b 1 r = b 1
Lecture 1. The Category of Sets PCMI Summer 2015 Undergraduate Lectures on Fag Varieties Lecture 1. Some basic set theory, a moment of categorica zen, and some facts about the permutation groups on n etters.
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 informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationTIGHT HAMILTON CYCLES IN RANDOM HYPERGRAPHS
TIGHT HAMILTON CYCLES IN RANDOM HYPERGRAPHS PETER ALLEN*, JULIA BÖTTCHER*, YOSHIHARU KOHAYAKAWA, AND YURY PERSON Abstract. We give an agorithmic proof for the existence of tight Hamiton cyces in a random
More informationGeneralised colouring sums of graphs
PURE MATHEMATICS RESEARCH ARTICLE Generaised coouring sums of graphs Johan Kok 1, NK Sudev * and KP Chithra 3 Received: 19 October 015 Accepted: 05 January 016 First Pubished: 09 January 016 Corresponding
More informationXSAT of linear CNF formulas
XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationMat 1501 lecture notes, penultimate installment
Mat 1501 ecture notes, penutimate instament 1. bounded variation: functions of a singe variabe optiona) I beieve that we wi not actuay use the materia in this section the point is mainy to motivate the
More informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationA Cryptographic Proof of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
A Cryptographic Proof of Reguarity Lemmas: Simper Unified Proofs and Refined Bounds Maciej Skórski IST Austria maciej.skorski@gmai.com Abstract. In this work we present a short and unified proof for the
More informationConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,
More informationFOURIER SERIES ON ANY INTERVAL
FOURIER SERIES ON ANY INTERVAL Overview We have spent considerabe time earning how to compute Fourier series for functions that have a period of 2p on the interva (-p,p). We have aso seen how Fourier series
More informationCryptanalysis of PKP: A New Approach
Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in
More informationOn colorings of the Boolean lattice avoiding a rainbow copy of a poset arxiv: v1 [math.co] 21 Dec 2018
On coorings of the Booean attice avoiding a rainbow copy of a poset arxiv:1812.09058v1 [math.co] 21 Dec 2018 Baázs Patkós Afréd Rényi Institute of Mathematics, Hungarian Academy of Scinces H-1053, Budapest,
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationarxiv: v1 [math.fa] 23 Aug 2018
An Exact Upper Bound on the L p Lebesgue Constant and The -Rényi Entropy Power Inequaity for Integer Vaued Random Variabes arxiv:808.0773v [math.fa] 3 Aug 08 Peng Xu, Mokshay Madiman, James Mebourne Abstract
More informationTHE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES
THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia
More informationBourgain s Theorem. Computational and Metric Geometry. Instructor: Yury Makarychev. d(s 1, s 2 ).
Bourgain s Theorem Computationa and Metric Geometry Instructor: Yury Makarychev 1 Notation Given a metric space (X, d) and S X, the distance from x X to S equas d(x, S) = inf d(x, s). s S The distance
More informationK a,k minors in graphs of bounded tree-width *
K a,k minors in graphs of bounded tree-width * Thomas Böhme Institut für Mathematik Technische Universität Imenau Imenau, Germany E-mai: tboehme@theoinf.tu-imenau.de and John Maharry Department of Mathematics
More informationSeparation of Variables and a Spherical Shell with Surface Charge
Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation
More informationEmpty non-convex and convex four-gons in random point sets
Empty non-convex and convex four-gons in random point sets Ruy Fabia-Monroy 1, Cemens Huemer, and Dieter Mitsche 3 1 Departamento de Matemáticas, CINVESTAV-IPN, México Universitat Poitècnica de Cataunya,
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More informationare left and right inverses of b, respectively, then: (b b 1 and b 1 = b 1 b 1 id T = b 1 b) b 1 so they are the same! r ) = (b 1 r = id S b 1 r = b 1
Lecture 1. The Category of Sets PCMI Summer 2015 Undergraduate Lectures on Fag Varieties Lecture 1. Some basic set theory, a moment of categorica zen, and some facts about the permutation groups on n etters.
More information8 APPENDIX. E[m M] = (n S )(1 exp( exp(s min + c M))) (19) E[m M] n exp(s min + c M) (20) 8.1 EMPIRICAL EVALUATION OF SAMPLING
8 APPENDIX 8.1 EMPIRICAL EVALUATION OF SAMPLING We wish to evauate the empirica accuracy of our samping technique on concrete exampes. We do this in two ways. First, we can sort the eements by probabiity
More informationarxiv: v1 [math.co] 17 Dec 2018
On the Extrema Maximum Agreement Subtree Probem arxiv:1812.06951v1 [math.o] 17 Dec 2018 Aexey Markin Department of omputer Science, Iowa State University, USA amarkin@iastate.edu Abstract Given two phyogenetic
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
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 informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationHaar Decomposition and Reconstruction Algorithms
Jim Lambers MAT 773 Fa Semester 018-19 Lecture 15 and 16 Notes These notes correspond to Sections 4.3 and 4.4 in the text. Haar Decomposition and Reconstruction Agorithms Decomposition Suppose we approximate
More information4 Separation of Variables
4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE
More informationGeneralized Bell polynomials and the combinatorics of Poisson central moments
Generaized Be poynomias and the combinatorics of Poisson centra moments Nicoas Privaut Division of Mathematica Sciences Schoo of Physica and Mathematica Sciences Nanyang Technoogica University SPMS-MAS-05-43,
More informationTIGHT HAMILTON CYCLES IN RANDOM HYPERGRAPHS
TIGHT HAMILTON CYCLES IN RANDOM HYPERGRAPHS PETER ALLEN*, JULIA BÖTTCHER*, YOSHIHARU KOHAYAKAWA, AND YURY PERSON Abstract. We give an agorithmic proof for the existence of tight Hamiton cyces in a random
More informationTheory of Generalized k-difference Operator and Its Application in Number Theory
Internationa Journa of Mathematica Anaysis Vo. 9, 2015, no. 19, 955-964 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/10.12988/ijma.2015.5389 Theory of Generaized -Difference Operator and Its Appication
More informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More informationOrdered Ramsey numbers
Ordered Ramsey numbers David Conlon Jacob Fox Choongbum Lee Benny Sudakov Abstract Given a labeled graph H with vertex set {1, 2,..., n}, the ordered Ramsey number r < (H) is the minimum N such that every
More informationInvestigation on spectrum of the adjacency matrix and Laplacian matrix of graph G l
Investigation on spectrum of the adjacency matrix and Lapacian matrix of graph G SHUHUA YIN Computer Science and Information Technoogy Coege Zhejiang Wani University Ningbo 3500 PEOPLE S REPUBLIC OF CHINA
More informationIntegrating Factor Methods as Exponential Integrators
Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been
More informationCompetitive Diffusion in Social Networks: Quality or Seeding?
Competitive Diffusion in Socia Networks: Quaity or Seeding? Arastoo Fazei Amir Ajorou Ai Jadbabaie arxiv:1503.01220v1 [cs.gt] 4 Mar 2015 Abstract In this paper, we study a strategic mode of marketing and
More informationThe Group Structure on a Smooth Tropical Cubic
The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,
More informationMIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI
MIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI KLAUS SCHMIDT AND TOM WARD Abstract. We prove that every mixing Z d -action by automorphisms of a compact, connected, abeian group is
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 informationNIKOS FRANTZIKINAKIS. N n N where (Φ N) N N is any Følner sequence
SOME OPE PROBLEMS O MULTIPLE ERGODIC AVERAGES IKOS FRATZIKIAKIS. Probems reated to poynomia sequences In this section we give a ist of probems reated to the study of mutipe ergodic averages invoving iterates
More informationarxiv: v1 [cs.db] 25 Jun 2013
Communication Steps for Parae Query Processing Pau Beame, Paraschos Koutris and Dan Suciu {beame,pkoutris,suciu}@cs.washington.edu University of Washington arxiv:1306.5972v1 [cs.db] 25 Jun 2013 June 26,
More information1. Introduction Given k 2, a k-uniform hypergraph (in short, k-graph) consists of a vertex set V and an edge set E ( V
MINIMUM VERTEX DEGREE THRESHOLD FOR C 4-TILING JIE HAN AND YI ZHAO Abstract. We prove that the vertex degree threshold for tiling C4 (the - uniform hypergraph with four vertices and two triples in a -uniform
More informationEmmanuel Abbe Colin Sandon
Detection in the stochastic bock mode with mutipe custers: proof of the achievabiity conjectures, acycic BP, and the information-computation gap Emmanue Abbe Coin Sandon Abstract In a paper that initiated
More informationOn tight cycles in hypergraphs
On tight cycles in hypergraphs Hao Huang Jie Ma Abstract A tight k-uniform l-cycle, denoted by T Cl k, is a k-uniform hypergraph whose vertex set is v 0,, v l 1, and the edges are all the k-tuples {v i,
More informationAlgorithms to solve massively under-defined systems of multivariate quadratic equations
Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations
More informationHAMILTON DECOMPOSITIONS OF ONE-ENDED CAYLEY GRAPHS
HAMILTON DECOMPOSITIONS OF ONE-ENDED CAYLEY GRAPHS JOSHUA ERDE, FLORIAN LEHNER, AND MAX PITZ Abstract. We prove that any one-ended, ocay finite Cayey graph with non-torsion generators admits a decomposition
More informationA UNIVERSAL METRIC FOR THE CANONICAL BUNDLE OF A HOLOMORPHIC FAMILY OF PROJECTIVE ALGEBRAIC MANIFOLDS
A UNIERSAL METRIC FOR THE CANONICAL BUNDLE OF A HOLOMORPHIC FAMILY OF PROJECTIE ALGEBRAIC MANIFOLDS DROR AROLIN Dedicated to M Saah Baouendi on the occasion of his 60th birthday 1 Introduction In his ceebrated
More informationON SEQUENCES WITHOUT GEOMETRIC PROGRESSIONS
MATHEMATICS OF COMPUTATION VOLUME 00, NUMBER 00 Xxxx 19xx, PAGES 000 000 ON SEQUENCES WITHOUT GEOMETRIC PROGRESSIONS BRIENNE E. BROWN AND DANIEL M. GORDON Abstract. Severa aers have investigated sequences
More informationAn asymptotic multipartite Kühn-Osthus theorem
An asymptotic multipartite Kühn-Osthus theorem Ryan R. Martin 1 Richard Mycroft 2 Jozef Skokan 3 1 Iowa State University 2 University of Birmingham 3 London School of Economics 08 August 2017 Algebraic
More informationPattern Frequency Sequences and Internal Zeros
Advances in Appied Mathematics 28, 395 420 (2002 doi:10.1006/aama.2001.0789, avaiabe onine at http://www.ideaibrary.com on Pattern Frequency Sequences and Interna Zeros Mikós Bóna Department of Mathematics,
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
More informationIntegrality ratio for Group Steiner Trees and Directed Steiner Trees
Integraity ratio for Group Steiner Trees and Directed Steiner Trees Eran Haperin Guy Kortsarz Robert Krauthgamer Aravind Srinivasan Nan Wang Abstract The natura reaxation for the Group Steiner Tree probem,
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationGROUP STRUCTURES OF ELLIPTIC CURVES OVER FINITE FIELDS
GROUP STRUCTURES OF ELLIPTIC CURVES OVER FINITE FIELDS VORRAPAN CHANDEE, CHANTAL DAVID, DIMITRIS OUOULOPOULOS, AND ETHAN SMITH Abstract. It is we-known that if E is an eiptic curve over the finite fied
More informationRate-Distortion Theory of Finite Point Processes
Rate-Distortion Theory of Finite Point Processes Günther Koiander, Dominic Schuhmacher, and Franz Hawatsch, Feow, IEEE Abstract We study the compression of data in the case where the usefu information
More informationSydU STAT3014 (2015) Second semester Dr. J. Chan 18
STAT3014/3914 Appied Stat.-Samping C-Stratified rand. sampe Stratified Random Samping.1 Introduction Description The popuation of size N is divided into mutuay excusive and exhaustive subpopuations caed
More informationLarge induced trees in K r -free graphs
Large induced trees in K r -free graphs Jacob Fox Po-Shen Loh Benny Sudakov Abstract For a graph G, let t(g) denote the maximum number of vertices in an induced subgraph of G that is a tree. In this paper,
More information4 1-D Boundary Value Problems Heat Equation
4 -D Boundary Vaue Probems Heat Equation The main purpose of this chapter is to study boundary vaue probems for the heat equation on a finite rod a x b. u t (x, t = ku xx (x, t, a < x < b, t > u(x, = ϕ(x
More informationNOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS
NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs
More informationNonnegative k-sums, fractional covers, and probability of small deviations
Nonnegative k-sums, fractional covers, and probability of small deviations Noga Alon Hao Huang Benny Sudakov Abstract More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers
More informationSequential Decoding of Polar Codes with Arbitrary Binary Kernel
Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient
More informationHomework 5 Solutions
Stat 310B/Math 230B Theory of Probabiity Homework 5 Soutions Andrea Montanari Due on 2/19/2014 Exercise [5.3.20] 1. We caim that n 2 [ E[h F n ] = 2 n i=1 A i,n h(u)du ] I Ai,n (t). (1) Indeed, integrabiity
More informationReichenbachian Common Cause Systems
Reichenbachian Common Cause Systems G. Hofer-Szabó Department of Phiosophy Technica University of Budapest e-mai: gszabo@hps.ete.hu Mikós Rédei Department of History and Phiosophy of Science Eötvös University,
More informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationCodegree problems for projective geometries
Codegree problems for projective geometries Peter Keevash Yi Zhao Abstract The codegree density γ(f ) of an r-graph F is the largest number γ such that there are F -free r-graphs G on n vertices such that
More informationTiling on multipartite graphs
Tiling on multipartite graphs Ryan Martin Mathematics Department Iowa State University rymartin@iastate.edu SIAM Minisymposium on Graph Theory Joint Mathematics Meetings San Francisco, CA Ryan Martin (Iowa
More informationBALANCING REGULAR MATRIX PENCILS
BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationBASIC NOTIONS AND RESULTS IN TOPOLOGY. 1. Metric spaces. Sets with finite diameter are called bounded sets. For x X and r > 0 the set
BASIC NOTIONS AND RESULTS IN TOPOLOGY 1. Metric spaces A metric on a set X is a map d : X X R + with the properties: d(x, y) 0 and d(x, y) = 0 x = y, d(x, y) = d(y, x), d(x, y) d(x, z) + d(z, y), for a
More information