Rainbow Hamilton cycles in uniform hypergraphs
|
|
- Iris Harper
- 6 years ago
- Views:
Transcription
1 Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI Alan Frieze Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA Andrzej Rucińsi Department of Discrete Mathematics Adam Miciewicz University Poznań, Poland Submitted: Sep 7, 2011; Accepted: Feb 8, 2012; Published: Feb 23, 2012 Mathematics Subject Classifications: 05C15, 05C65 Abstract Let K n () be the complete -uniform hypergraph, 3, and let l be an integer such that 1 l 1 and l divides n. An l-overlapping Hamilton cycle in K n () is a spanning subhypergraph C of K n () with n/( l) edges and such that for some cyclic ordering of the vertices each edge of C consists of consecutive vertices and every pair of adjacent edges in C intersects in precisely l vertices. We show that, for some constant c = c(, l) and sufficiently large n, for every coloring (partition) of the edges of K n () which uses arbitrarily many colors but no color appears more than cn l times, there exists a rainbow l-overlapping Hamilton cycle C, that is every edge of C receives a different color. We also prove that, for some constant c = c (, l) and sufficiently large n, for every coloring of the edges in which the maximum degree of the subhypergraph induced by any single color is bounded by c n l, there exists a properly colored l-overlapping Hamilton cycle C, that is every two adjacent edges receive different colors. For l = 1, both results are (trivially) best possible up to the constants. It is an open question if our results are also optimal for 2 l 1. The proofs rely on a version of the Lovász Local Lemma and incorporate some ideas from Albert, Frieze, and Reed. of K () n Supported in part by NSF grant CCF Supported in part by the Polish NSC grant N and the NSF grant DMS the electronic journal of combinatorics 19 (2012), #P46 1
2 1 Introduction By a coloring of a hypergraph H we mean any function φ : H N assigning natural numbers (colors) to the edges of H. (In this paper we do not consider vertex colorings.) A hypergraph H together with a given coloring φ will be dubbed a colored hypergraph. A subhypergraph F of a colored hypergraph H is said to be properly colored if every two adjacent edges of F receive different colors. (Two different edges are adjacent if they share at least one vertex.) We say that a subhypergraph F of a colored hypergraph H is rainbow if every edge of F receives a different color, that is, when φ is injective on F. In order to force the presence of properly colored or rainbow subhypergraphs one has to restrict the colorings φ, either globally or locally. A coloring φ is r-bounded if every color is used at most r times, that is, φ 1 (i) r for all i N. A coloring φ is r-degree bounded if the hypergraph induced by any single color has maximum degree bounded by r, that is, (H[φ 1 (i)]) r for all i N. In this paper we study the existence of properly colored and rainbow Hamilton cycles in colored -uniform complete hypergraphs, 3. (A hypergraph is -uniform if every edge has size ; it is complete if all -element subsets of the vertices form edges.) There is a broad literature on this subject for = 2, that is, for graphs. Indeed, setting r = cn, Alon and Gutin proved in [2], improving upon earlier results from [5, 6, 16] that if c < 1 1/ 2 then any r-degree bounded coloring of the edges of the complete graph K n yields a properly colored Hamilton cycle (for the history of the problem, see [3]). It had been conjectured in [5] that the constant 1 1/ 2 can be replaced by 1 which is the 2 best possible. Rainbow Hamilton cycles in r-bounded colorings of the complete graph have been studied in [1, 8, 10, 12]. Hahn and Thomassen conjectured that their existence is guaranteed if r = cn for some c > 0. This was confirmed by Albert, Frieze, and Reed in [1] with c = 1. Again, c = 1/2 seems to be a critical value here, since one can use 64 each of n 1 colors exactly n/2 times, maing the presence of rainbow Hamilton cycles impossible. In striing contrast, there is literally nothing nown on properly colored or rainbow Hamilton cycles in colored -uniform hypergraphs for 3. The notion of a hypergraph cycle can be ambiguous. In this paper we are not concerned with the Berge cycles as defined by Berge in [4] (see also [11]). Instead, following a recent trend in the literature ([7, 13, 15]), given an integer 1 l <, we define an l-overlapping cycle as a -uniform hypergraph in which, for some cyclic ordering of its vertices, every edge consists of consecutive vertices, and every two consecutive edges (in the natural ordering of the edges induced by the ordering of the vertices) share exactly l vertices. (See Fig. 1 for an example of a 2-overlapping and a 3-overlapping 5-uniform cycle.) The two extreme cases of l = 1 and l = 1 are referred to as, respectively, loose and tight cycles. Note that the number of edges of an l-overlapping cycle with s vertices is s/( l). Note also that when l divides s, every tight cycle on s vertices contains an l-overlapping cycle on the same vertex set (with the same cyclic ordering). Given a -uniform hypergraph H on n vertices, where l divides n, an l-overlapping cycle contained in H is called Hamilton if it goes through every vertex of H, that is, if the electronic journal of combinatorics 19 (2012), #P46 2
3 Figure 1: A 2-overlapping and a 3-overlapping 5-uniform cycle. s = n. We denote such a Hamilton cycle by C n () (l). In this paper we prove the following two results. Let K n () hypergraph of order n. be the complete -uniform Theorem 1.1 For every 1 l < there is a constant c = c(, l) such that if n is sufficiently large and l divides n then any cn l -bounded coloring of K n () yields a rainbow copy of C n () (l). Theorem 1.2 For every 1 l < there is a constant c = c (, l) such that if n is sufficiently large and l divides n then any c n l -degree bounded coloring of K n () yields a properly colored copy of C n () (l). Note that for loose Hamilton cycles (i.e. l = 1) the above results are optimal up to the values of c and c. Theorem 1.2 is trivially optimal, as the largest maximum degree can be at most r = ( ) n ( 1)! n 1. To see that also Theorem 1.1 is optimal up to the constant for l = 1 consider any coloring of K n () using each color precisely ( n r = ) n 1 1 n 1! 1 times, and thus using only n 1 colors altogether. Such a coloring is r-bounded and, 1 clearly, there is no rainbow copy of C n () (1). Problem 1.3 For all 3 and l = 1, determine sup c and sup c over all values of c and, respectively, c for which Theorems 1.1 and 1.2 hold. We believe that Theorems 1.1 and 1.2 are optimal up to the constants also for l 2, that is, we believe that the answer to the following question is positive. Problem 1.4 For all 3 and 2 l 1, does there exist an r-bounded (r-degree bounded) coloring φ of K n () such that r = Θ(n l ) and no copy of C n () (l) is rainbow (properly colored)? As some evidence supporting our belief, consider the bipartite version of both problems for = 3 and l = 2. Let K (3) n,2n = (V 1, V 2, E), where V 1 = n, V 2 = 2n and E = {e V 1 V 2 : e V i = i, i = 1, 2}. To every edge e assign the pair e V 2 as its color. Clearly, every color appears exactly n times and hence such a coloring is n-bounded (and the electronic journal of combinatorics 19 (2012), #P46 3
4 thus n-degree bounded). Finally, note that every tight Hamilton cycle in K (3) n,2n induces a cyclic sequence of vertices with a repeated pattern of two vertices from V 2 followed by one vertex from V 1. Hence, there is a pair of consecutive edges with the same color (actually, there are n such pairs), and so no copy of a properly colored (or rainbow) C n (3) (2) exists. 2 The proofs We will need a special version of the Lovász Local Lemma. A similar result was already established in [1, 9, 14]. Contrary to the above results, in our formulation of the lemma we avoid conditional probabilities so that we do not need to mae a priori assumptions that certain events have positive probability. Lemma 2.1 Let A 1, A 2,..., A m be events in an arbitrary probability space Ω. For each 1 i m, let [m] \ {i} = X i Y i be a partition of the index set [m] \ {i} and let If for each 1 i m and all X X i ( Pr A i ) A j then Pr ( m i=1 A i d = max{ Y i : 1 i m}. (1) j X ( ) 1 4(d + 1) Pr A j j X ) > 0. (We adopt the convention that j A j = Ω.) Proof. We prove by induction on t = 1,..., m, that for every T [m], T = t, and for every i T, setting S = T \ {i}, we have ( ) ( ) 1 Pr A i > 0 and Pr A i A i 2(d + 1). (3) i T For t = 1 we apply (2) with X =, obtaining for each i that Pr (A i ) 1, equivalently 4(d+1) Pr ( ) A i 1 1 > 0, which confirms (3) for t = 1. 4(d+1) Now, assume truth for some t, 1 t m 1, and consider a set T = {i} S, where i S and S = t. Set X = S X i and Y = S Y i, and observe that S = X Y and Y Y i d. By the induction assumption Pr( j S A j) > 0. If Y = (and thus X = S), by our assumption (2), ( ) 1 Pr A i A j 4(d + 1). j S Otherwise, X < S = t and, again by (2) (in the numerator) and the induction assumption (in the denominator) we argue that ( ) ( Pr A i j Y A j ) j X A 1 j Pr A i A j = ( j S Pr j Y A j 4(d+1) 1 ) j X A 1 1 Y 2(d + 1). j 2(d+1) i S (2) the electronic journal of combinatorics 19 (2012), #P46 4
5 Thus, ( ) ( ) Pr A j = Pr A i A j Pr( A j ) > 0, j S j T which completes the proof of Lemma 2.1. The proofs of Theorems 1.1 and 1.2 extend some ideas introduced by Albert, Frieze and Reed in [1]. j S Proof of Theorem 1.1. Fix 1 l < and a cn l -bounded coloring φ of K n () constant c > 0 to be specified later. Define for some M = {{e, f} : e, f K () n, e f l and φ(e) = φ(f)}. Moreover, for every pair {e, f} M set A e,f = {C K () n : C = C n () ( 1) and {e, f} C}. In order to prove Theorem 1.1 it suffices to show that A e,f. (4) {e,f} M Indeed, if (4) is true then there is a tight Hamilton cycle C = C n () ( 1) such that for every pair of its edges e and f with e f l we have φ(e) φ(f). Since, by assumption, l divides n, C contains a copy of C n () (l) which is rainbow, as required. To prove (4) we apply the probabilistic method and Lemma 2.1. To this end, for a given pair {e, f} M let and Y e,f = {{e, f } M : {e, f } {e, f} and (e f) (e f ) } X e,f = M \ (Y e,f {e, f}). To estimate d (cf. (1)), we bound from above the size of Y e,f as follows. For given edges e and f we can find at most 2n 1 edges e sharing a vertex from e f. For every such e we have at most cn l candidates for f, since e and f must have the same color. Thus, d = max Y e,f 2cn 2 l 1. (5) {e,f} M Now, let us consider a uniform probability space consisting of all tight Hamilton cycles C = C n () ( 1) in K n (). In order to prove (4), and thus finish the proof of Theorem 1.1, it suffices to show that Pr > 0. (6) {e,f} M A e,f the electronic journal of combinatorics 19 (2012), #P46 5
6 Thus, it remains to verify assumption (2) of Lemma 2.1 with m = M, A i := A e,f, X i := X e,f, and Y i := Y e,f. Fix {e, f} M and X X e,f and set C = {e,f } X A e,f and C 1 = A e,f A e,f. {e,f } X In other words, C is the set of all copies C of C n () ( 1) in K n () such that {g, h} C for all {g, h} X, while C 1 = {C C : {e, f} C}. If C 1 = then the R-H-S of (2) equals zero and there is nothing to prove. Otherwise, we rely on the following technical result the proof of which is postponed to the next section. Proposition 2.2 For all 1 l < there exist constants δ = δ(, l), 0 < δ < 1, such that for every pair e, f of edges of K n () with e f l and for every set X of pairs g, h of edges of K n () satisfying (g h) (e f) =, if C 1, one can find a disjoint family {S C : C C 1 } of sets of copies of C n () ( 1) from C (indexed by the copies C C 1 ) such that for all C C 1 we have S C δn 2 l 1. We are now able to specify the constant c by setting c = δ 10, (7) where δ = δ(, l) is the constant given by Proposition 2.2. Then by Proposition 2.2, (5), and (7) Pr (A e,f ) {e,f } X A e,f ( ) = C 1 Pr {e,f } X A C C 1 e,f C C 1 S C 1 δn 1 2 l 1 4(d + 1). Hence, (2) holds and we are in position to apply Lemma 2.1 and conclude that (6) and, consequently, (4) is true. This completes the proof of Theorem 1.1. Proof of Theorem 1.2. This proof goes along the lines of the proof of Theorem 1.1. Let c = δ, where δ = δ(, l) is the constant given by Proposition 2.2. Fix a c n l -degree 10 2 bounded coloring of K n (). Here we slightly modify the definition of M. Let M = {{e, f} : e, f K () n, 1 e f l and φ(e) = φ(f)}. As before, A e,f = {C K () n : C = C n () ( 1) and {e, f} C}. the electronic journal of combinatorics 19 (2012), #P46 6
7 and in order to prove Theorem 1.2 it suffices to show that A e,f. (8) {e,f} M Indeed, if (8) is true then there is a tight Hamilton cycle C = C n () ( 1) such that for every pair of its edges e and f with 1 e f l we have φ(e) φ(f). Since, by assumption, l divides n, C contains a copy of C n () (l) which is properly colored, as required. We define sets Y e,f and X e,f as before and recalculate the upper bound on Y e,f. For given edges e and f we can find at most 2n 1 edges e sharing a vertex from e f. For every such e we have at most c n l candidates for f since e and f intersect and have the same color. Thus, Y e,f 2c 2 n 2 l 1. The rest of the proof is identical to the proof of Theorem 1.1 and therefore is omitted. 3 Proof of Proposition 2.2 Let e and f be given edges in K n () such that e f l and let C C 1 be a tight Hamilton cycle containing e and f and missing at least one edge from each pair {g, h} X. We describe two constructions depending on the size of e f. Construction 1: for 2 e f l. Let e f = a and let e = (u 1,..., u ) and f = (v 1,..., v ) be such that u a+1 = v 1, u a+2 = v 2,..., u = v a. This way we fix an orientation of C where e precedes f. Let P = C \ {e f} be the segment of C between f and e of length n 2 + a. We select arbitrarily 2 a 1 vertex disjoint edges g 1,..., g 2 a 1 from P, so that C is of the form e f g 1 g 2 a 1 e, where the symbol indicates a path between the given edges. Clearly, we have Ω(n 2 a 1 ) = Ω(n 2 l 1 ) choices for the g i s. Let g i = (w1, i..., w i ) for 1 i 2 a 1, where we list the vertices of g i in the order of appearance on P. In order to create a cycle C S C, we remove all edges which contain at least one vertex from (e f) \ {u 1, v } and also all edges whose first vertex (in the order induced by C) is wj i for 1 i 2 a 1 and j = 1,..., 1. After this removal, the vertices in the set {u 2,..., u, v a+1,..., v 1 } become isolated and the remains of the cycle C form a collection of vertex disjoint paths v w 1 1, w1 w 2 1, w2 w3 1,..., w2 a 1 u 1. To create C, we connect the above paths by absorbing the isolated vertices. Formally, the electronic journal of combinatorics 19 (2012), #P46 7
8 f e v 4 v 3 u 4 u 3 u 2 u 1 g 1 g 2 g 3 g 4 g 5 w 1 1 w1 2 w1 3 w1 4 w 2 1 w2 2 w2 3 w2 4 w 3 1 w3 2 w3 3 w3 4 w 4 1 w4 2 w4 3 w4 4 w 5 1 w5 2 w5 3 w5 4 Figure 2: The first construction for = 4 and a = 2. The dashed and solid lines denote C and C, respectively. we define C as the following sequence of vertices (see Fig. 2): v w 1 1, w 1 2,..., w 1 1, v 1, w 1 w 2 1, w 2 2,..., w 2 1, v 2, w 2... w1 a 1, w2 a 1,..., w a 1 1, v a+1, w a 1 w1 a, w2 a,..., w a 1, u, w a w1 a+1, w a ,..., w a+1 1 1, u 1, w a+1 w1 2 a 2, w2 2 a 2,..., w 2 a 2, u 2, w 2 a 2 w1 2 a 1, w2 2 a 1,..., w 2 a 1 1, u 1 w 2 a 1, v. It is easy to chec that every new edge intersects a vertex from e f. Thus, C \C contains no edge from any pair of edges belonging to X. Moreover, note that different choices of g i yield different cycles C. Thus, S C = Ω(n 2 l 1 ). It remains to show that for any two tight Hamilton cycles C C C 1 we have S C S C =. In order to prove it, one can reverse the above procedure and uniquely determine C and the edges g 1, g 2,..., g 2 a 1 from C. Note that we do not now the order in which the vertices of e and f are traversed by C. To reconstruct C, we first find in C a unique e f path Q with no endpoint in e f and exactly on vertex from e and f. From this we deduce that u 1 = Q e, v = Q f is the last vertex on Q before v. Now we start at v and follow C in the direction opposite to w 2 a 1. Before we reach u 1 we will intersect f e exactly 2 a 2 times. This way we restore the vertices v 1, v 2,..., v a+1, u, u 1,..., u 2 (in the order of appearance on C). Note that every one of these vertices is adjacent to two vertices w j 1 and wj for some 1 j 2 a 2. Consequently, we can uncover all edges g i and hence C itself. and w 2 a 1 the electronic journal of combinatorics 19 (2012), #P46 8
9 Construction 2: for e f 1. Here we show a stronger result, namely, we construct a family S C of size Ω(n 2( 1) ). Let e = (u 1,..., u ) and f = (v 1,..., v ). Note that it might happen that u = v 1 if e f = 1. Let P be a segment of vertices between e and f of size Ω(n). For given two vertices x and y denote by d(x, y) the number of vertices on P in the segment between x and y. Now we select 2( 1) vertex disjoint edges g 1,..., g 2( 1) from P so that C is of the form e f g 1 g 2( 1) e and d(v, w 1 1) < d(w 1, w 2 1) + 1 < d(w 2, w 3 1) + 1 < < d(w 2, w 1 ) + 1, (9) where g i = (w1, i..., w i ) for each 1 i 2( 1) and the vertices in g i are listed in the order of appearance on P. This way we fix an orientation of C. (The above sequence of inequalities will be needed later to establish the orientation of C from C.) Clearly, we have Ω(n 2( 1) ) choices for g i s. In order to create a cycle C S C, we remove all edges which contain at least one vertex from (e f) \ {u 1, v } and also all edges whose first vertex (in the order induced by C) is wj i for 1 i 2( 1) and j = 1,..., 1. After this removal, the vertices in the set {u 2,..., u 1, v 2,..., v 1 } become isolated and the remains of the cycle C form a collection of vertex disjoint paths v w 1 1, w1 w2 1, w2 w3 1,..., w2( 1) u 1, and u v 1. (The latter may be degenerated to the set of isolated vertices.) To create C, we connect the above paths by absorbing the isolated vertices. Formally, we define C as the following sequence of vertices (see Fig. 3): 1 v 1, w 1 1,w 1 2,..., w 1 1 v, w 1 w 2 1, w 2 2,..., w 2 1, v 1, w 2 w 3 1, w 3 2,..., w 3 1, v 2, w 3... w1 1, w2 1,..., w 1 1, v 2, w 1 w1, w2,..., w 1, u 1, w w1 +1, w2 +1,..., w +1 1, u 2, w w1 2 3, w2 2 3,..., w 2 3 1, u 2, w 2 3 w 2 2 1, w 2 2 2,..., w 2 2 1, u 1 w 2 2, u v 1. It is easy to chec that every new edge intersects a vertex from e f. Thus, C \C contains no edge from any pair of edges belonging to X. Moreover, note that different choices of g i yield different cycles C. Thus, S C = Ω(n 2( 1) ). It remains to show that for any two tight Hamilton cycles C C C 1 we have S C S C =. In order to prove it, one can reverse the above procedure and uniquely determine C and the edges g 1, g 2,..., g 2( 1) from C. Note that we do not now the order in which the vertices of e and f are traversed by C. the electronic journal of combinatorics 19 (2012), #P46 9
10 f v 4 v 3 v 2 v 1 u 4 u 3 u 2 u 1 e g 1 g 2 g 3 g 4 g 5 g 6 w 1 1 w1 2 w1 3 w1 4 w 2 1 w2 2 w2 3 w2 4 w 3 1 w3 2 w3 3 w3 4 w 4 1 w4 2 w4 3 w4 4 w 5 1 w5 2 w5 3 w5 4 w 6 1 w6 2 w6 3 w6 4 Figure 3: The second construction for = 4. The dashed and solid lines denote C and C, respectively. Note that there are exactly two shortest e f paths in C, say Q 1 and Q 2. One with u and v 1 as its endpoints and the second one with u 1 and v 2 as the endpoints. Our goal is to determine vertex v 1. Once this is nown then as in Construction 1 we can uncover all edges g i and hence C itself. We assume for a while that v 1 = Q 1 f. Then we start at v 1 and follow C in the direction opposite to the second endpoint of Q 1. Before we reach edge e we will intersect edge f exactly 1 times. This way we pretend that we restore vertices v, v 1,..., v 2 (in the order of appearance). Let d(x, y) be the number of vertices on C between vertices x and y. Note that d(v, w 1 1 ) = d(v 1, v ) 1 and d(w j, wj+1 1 ) = d(v j+1, v j ) 2 for 1 j 2. Now we chec if (9) holds. If so then Q 1 is really the path with endpoints u and v 1 ; otherwise Q 2 is the one. Acnowledgment We would lie to than the referees for their valuable comments and suggestions. References [1] M. Albert, A. Frieze and B. Reed, Multicoloured Hamilton cycles, Electronic Journal of Combinatorics 2 (1995), #R10. [2] N. Alon and G. Gutin, Properly colored Hamiltonian cycles in edge-colored complete graphs, Random Structures and Algorithms 11 (1997), [3] J. Bang-Jensen and G. Gutin, Alternating cycles and paths in edge-colored multigraphs: a survey, Discrete Mathematics (1997), [4] C. Berge, Nombres de coloration de l hypergraphe h-parti complet, Springer Lecture Notes in Math. Vol. 411 (1975) [5] B. Bollobás and P. Erdős, Alternating Hamiltonian cycles, Israel Journal of Mathematics 23 (1976), the electronic journal of combinatorics 19 (2012), #P46 10
11 [6] C. Chen and D. Dayin, Graphs with Hamiltonian cycles having adjacent lines different colors, Journal of Combinatorial Theory, Ser. B 21 (1976), [7] A. Dude and A. Frieze, Tight Hamilton cycles in random uniform hypergraphs, Random Structures & Algorithms (2012), doi: /rsa [8] P. Erdős, J. Nešetřil and V. Rödl, Some problems related to partitions of edges of a graph in Graphs and other Combinatorial topics, Teubner, Leipzig (1983), [9] P. Erdős and J. Spencer, Lopsided Lovász local lemma and Latin transversals, Discrete Applied Mathematics 30 (1990), [10] A. Frieze and B. Reed, Polychromatic Hamilton cycles, Discrete Mathematics 118, (1993), [11] A. Gyárfás, G. Sárözy, and E. Szemerédi, Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs, Journal of Graph Theory 63 (2010), [12] G. Hahn and C. Thomassen, Path and cycle sub-ramsey numbers and an edgecolouring conjecture, Discrete Mathematics 62 (1986), [13] A. Johansson, J. Kahn, and V. Vu, Factors in random graphs, Random Structures & Algorithms 33 (2008), [14] L. Lu and L. Széely, Using Lovász Local Lemma in the space of random injections, Electronic Journal of Combinatorics 14 (2007), #R63. [15] V. Rödl and A. Rucińsi, Dirac-type questions for hypergraphs a survey (or more problems for Endre to solve), Bolyai Soc. Math. Studies 21 (2010), An Irregular Mind (Szemerédi is 70), Bolyai Soc. Math. Studies 21 (2010), [16] J. Shearer, A property of the complete colored graph, Discrete Mathematics 25 (1979), the electronic journal of combinatorics 19 (2012), #P46 11
Rainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
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 informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationThe Lopsided Lovász Local Lemma
Joint work with Linyuan Lu and László Székely Georgia Southern University April 27, 2013 The lopsided Lovász local lemma can establish the existence of objects satisfying several weakly correlated conditions
More informationAdding random edges to create the square of a Hamilton cycle
Adding random edges to create the square of a Hamilton cycle Patrick Bennett Andrzej Dudek Alan Frieze October 7, 2017 Abstract We consider how many random edges need to be added to a graph of order n
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationOn balanced colorings of sparse hypergraphs
On balanced colorings of sparse hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu January 21, 2014 Abstract We investigate 2-balanced colorings
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
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 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 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 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 informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationOn the Regularity Method
On the Regularity Method Gábor N. Sárközy 1 Worcester Polytechnic Institute USA 2 Computer and Automation Research Institute of the Hungarian Academy of Sciences Budapest, Hungary Co-authors: P. Dorbec,
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationThe Lopsided Lovász Local Lemma
Department of Mathematics Nebraska Wesleyan University With Linyuan Lu and László Székely, University of South Carolina Note on Probability Spaces For this talk, every a probability space Ω is assumed
More informationOn a hypergraph matching problem
On a hypergraph matching problem Noga Alon Raphael Yuster Abstract Let H = (V, E) be an r-uniform hypergraph and let F 2 V. A matching M of H is (α, F)- perfect if for each F F, at least α F vertices of
More informationA note on network reliability
A note on network reliability Noga Alon Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics Tel Aviv University, Tel Aviv, Israel Let G = (V, E) be a loopless undirected multigraph,
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 informationCompatible Hamilton cycles in Dirac graphs
Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov Abstract A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationarxiv: v2 [math.co] 29 Oct 2017
arxiv:1404.3385v2 [math.co] 29 Oct 2017 A proof for a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles G.R. Omidi Department of Mathematical Sciences, Isfahan University of Technology,
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationLarge monochromatic components and long monochromatic cycles in random hypergraphs
Large monochromatic components and long monochromatic cycles in random hypergraphs Patric Bennett Louis DeBiasio Andrzej Dude Sean English September 9, 2017 Abstract We extend results of Gyárfás and Füredi
More informationAn alternative proof of the linearity of the size-ramsey number of paths. A. Dudek and P. Pralat
An alternative proof of the linearity of the size-ramsey number of paths A. Dudek and P. Pralat REPORT No. 14, 2013/2014, spring ISSN 1103-467X ISRN IML-R- -14-13/14- -SE+spring AN ALTERNATIVE PROOF OF
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 informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
More informationSHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS. Joanna Polcyn. Department of Discrete Mathematics Adam Mickiewicz University
Discussiones Mathematicae Graph Theory 24 (2004 ) 469 484 SHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS Joanna Polcyn Department of Discrete Mathematics Adam Mickiewicz University Poznań e-mail: joaska@amu.edu.pl
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More informationLoose Hamilton Cycles in Random k-uniform Hypergraphs
Loose Hamilton Cycles in Random k-uniform Hypergraphs Andrzej Dudek and Alan Frieze Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513 USA Abstract In the random k-uniform
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh Benny Sudakov Abstract An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(g) denote
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More 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 informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationHARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY
HARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY SOURAV CHAKRABORTY 1 AND ELDAR FISCHER 1 AND ARIE MATSLIAH 2 AND RAPHAEL YUSTER 3 1 Department of Computer Science, Technion, Haifa 32000, Israel. E-mail
More 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 informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
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 informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationBisections of graphs
Bisections of graphs Choongbum Lee Po-Shen Loh Benny Sudakov Abstract A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and
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 informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationSubhypergraph counts in extremal and random hypergraphs and the fractional q-independence
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Andrzej Dudek adudek@emory.edu Andrzej Ruciński rucinski@amu.edu.pl June 21, 2008 Joanna Polcyn joaska@amu.edu.pl
More informationarxiv: v1 [math.co] 18 Nov 2017
Short proofs for generalizations of the Lovász Local Lemma: Shearer s condition and cluster expansion arxiv:171106797v1 [mathco] 18 Nov 2017 Nicholas J A Harvey Abstract Jan Vondrák The Lovász Local Lemma
More informationSize and degree anti-ramsey numbers
Size and degree anti-ramsey numbers Noga Alon Abstract A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-ramsey number of H, denoted
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationChromatic Ramsey number of acyclic hypergraphs
Chromatic Ramsey number of acyclic hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas@renyi.hu Alexander
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 informationQuadruple Systems with Independent Neighborhoods
Quadruple Systems with Independent Neighborhoods Zoltan Füredi Dhruv Mubayi Oleg Pikhurko Abstract A -graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationBipartite decomposition of random graphs
Bipartite decomposition of random graphs Noga Alon Abstract For a graph G = (V, E, let τ(g denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of G so that each edge of G belongs
More informationPartitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationGame saturation of intersecting families
Game saturation of intersecting families Balázs Patkós Máté Vizer November 30, 2012 Abstract We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = {1,
More informationMONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS
MONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS ELAD AIGNER-HOREV AND YURY PERSON Abstract. Given a dense subset A of the first n positive integers, we provide a short proof showing
More informationOn the connectivity of extremal Ramsey graphs
On the connectivity of extremal Ramsey graphs Andrew Beveridge and Oleg Pikhurko Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Abstract An (r, b)-graph is a graph
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More informationDegree Ramsey numbers for even cycles
Degree Ramsey numbers for even cycles Michael Tait Abstract Let H s G denote that any s-coloring of E(H) contains a monochromatic G. The degree Ramsey number of a graph G, denoted by R (G, s), is min{
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 informationLecture 1 : Probabilistic Method
IITM-CS6845: Theory Jan 04, 01 Lecturer: N.S.Narayanaswamy Lecture 1 : Probabilistic Method Scribe: R.Krithika The probabilistic method is a technique to deal with combinatorial problems by introducing
More informationOn the size-ramsey numbers for hypergraphs. A. Dudek, S. La Fleur and D. Mubayi
On the size-ramsey numbers for hypergraphs A. Dudek, S. La Fleur and D. Mubayi REPORT No. 48, 013/014, spring ISSN 1103-467X ISRN IML-R- -48-13/14- -SE+spring On the size-ramsey number of hypergraphs Andrzej
More informationRainbow factors in hypergraphs
Rainbow factors in hypergraphs Matthew Coulson Peter Keevash Guillem Perarnau Liana Yepremyan March 27, 2018 Abstract For any r-graph H, we consider the problem of finding a rainbow H-factor in an r-graph
More informationAn explicit construction for a generalized Ramsey problem
n explicit construction for a generalized Ramsey problem hruv Mubayi June 27, 2002 bstract n explicit coloring of the edges of K n is constructed such that every copy of K 4 has at least four colors on
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationA counter-example to Voloshin s hypergraph co-perfectness conjecture
A counter-example to Voloshin s hypergraph co-perfectness conjecture Daniel Král Department of Applied Mathematics and Institute for Theoretical Computer Science (ITI) Charles University Malostranské náměstí
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationMaximizing the number of independent sets of a fixed size
Maximizing the number of independent sets of a fixed size Wenying Gan Po-Shen Loh Benny Sudakov Abstract Let i t (G be the number of independent sets of size t in a graph G. Engbers and Galvin asked how
More informationAn Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes)
An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes) Nicholas J. A. Harvey University of British Columbia Vancouver, Canada nickhar@cs.ubc.ca Jan Vondrák
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More 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 informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationTwo-coloring random hypergraphs
Two-coloring random hypergraphs Dimitris Achlioptas Jeong Han Kim Michael Krivelevich Prasad Tetali December 17, 1999 Technical Report MSR-TR-99-99 Microsoft Research Microsoft Corporation One Microsoft
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationHardness and Algorithms for Rainbow Connection
Hardness and Algorithms for Rainbow Connection Sourav Chakraborty Eldar Fischer Arie Matsliah Raphael Yuster Abstract An edge-colored graph G is rainbow connected if any two vertices are connected by a
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More informationUsing Lovász Local Lemma in the space of random injections
Using Lovász Local Lemma in the space of random injections Linyuan Lu László Székely University of South Carolina {lu, szekely}@math.sc.edu Submitted: Nov 6, 2006; Accepted: Sep 3, 2007; Published: Sep
More information