Loose Hamilton Cycles in Random k-uniform Hypergraphs
|
|
- Jessie Briggs
- 6 years ago
- Views:
Transcription
1 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 hypergraph H n,p;k of order n each possible k-tuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of adjacent edges intersects in a single vertex. We prove that if pn k 1 / log n tends to infinity with n then lim Pr(H n n,p;k contains a loose Hamilton cycle = 1. (k 1 n This is asymptotically best possible. 1 Introduction The threshold for the existence of Hamilton cycles in the random graph G n,p has been known for many years, see, e.g., [1], [3] and [9]. There have been many generalizations of these results over the years and the problem is well understood. It is natural to try to extend these results to hypergraphs and this has proven to be difficult. The famous Pósa lemma fails to provide any comfort and we must seek new tools. In the graphical case, Hamilton cycles and perfect matchings go together and our approach will be to build on the deep and difficult result of Johansson, Kahn and Vu [8], as well as what we have learned from the graphical case. A k-uniform hypergraph is a pair (V, E where E ( V k. In the random k-uniform hypergraph H n,p;k of order n each possible k-tuple appears independently with probability p. We say that a k-uniform hypergraph (V, E is a loose Hamilton cycle if there exists a cyclic ordering of the vertices V such that every edge consists of k consecutive vertices and every pair of consecutive edges intersects in a single vertex. In other words, a loose Hamilton cycle has the minimum possible number of edges among all cycles on V vertices. In a recent paper the second author proved the following: Supported in part by NSF grant CCF
2 Theorem 1 (Frieze [4] There exists an absolute constant K > 0 such that if p K(log n/n then lim Pr(H n n,p;3 contains a loose Hamilton cycle = 1. 4 n In this paper we refine the above theorem to k 4. Here we state our main result. Theorem Let k 3. If pn k 1 / log n tends to infinity together with n then lim Pr(H n n,p;k contains a loose Hamilton cycle = 1. (k 1 n Thus (log n/n k 1 is the asymptotic threshold for the existence of loose Hamilton cycles, at least for n a multiple of (k 1. This is because if p (1 ɛ(k 1!(log n/n k 1 and ɛ > 0 is constant, then whp 1 H n,p;k contains isolated vertices. Notice that the necessary divisibility requirement for a k-uniform hypergraph to have a loose Hamilton cycle is (k 1 n. In our approach we needed to assume more, namely, (k 1 n (the same is true for Theorem 1. There are other ways of defining Hamilton cycles in hypergraphs, depending on the size of the intersection of successive edges. As far as we know, when these intersections have more than one vertex, nothing significant is known about existence thresholds. Our proof uses a second moment calculation on a related problem. We cannot apply a second moment calculation directly to the number of Hamilton cycles in H n,p;k, this does not work. Proof of Theorem Fix an integer k 3. Set κ = k and let n = (k 1m. We immediately see the divisibility requirement (k 1 n. Let pn k 1 / log n tend to infinity together with n (or equivalently together with m. From on now, all asymptotic notations are with respect to m. We start with a special case of the theorem of [8]. Let S and T be disjoint sets. Let Γ = Γ(S, T, p be the random k-uniform hypergraph such that each k-edge in ( ( S T κ is independently included with probability p. Assuming that S = m and T = κm for some positive integer m, a perfect matching of Γ is a set of m k-edges {s i 1, s i, t i,1,..., t i,κ }, 1 i m, such that {s 1,..., s m } = S and {t 1,1,..., t m,κ } = T. Theorem 3 (Johansson, Kahn and Vu [8] There exists an absolute constant K > 0 such that if p K(log n/n k 1 then whp Γ contains a perfect matching. This version is not actually proved in [8], but can be obtained by straightforward changes to their proof. Now we (deterministically partition [n] into X = [m] and Y = [m + 1, n], where clearly X = m and Y = κm. We show that Γ(X, Y, p, which can be viewed as the subgraph 1 An event E n occurs with high probability, or whp for brevity, if lim n Pr(E n = 1.
3 of H n,p;k induced by ( X ( Y κ, contains a loose Hamilton cycle whp. Such a Hamilton cycle will consist of m edges of the form {x i, x i+1, y i,1,..., y i,κ }, where 1 i m, x m+1 = x 1, {x 1,..., x m } = X and {y 1,1,..., y m,κ } = Y. Let d be an arbitrarily large even positive integer constant. Let X be a set of size dm representing d copies of each x X. Denote the jth copy of x X by x (j X and let X x = { x (j, j = 1,,..., d }. Then let X 1, X,..., X d be a uniform random partition of X into d sets of size m. Define ψ 1 : X X by ψ 1 (x (j = x for all j and x X. Similarly, we let Y be a set of size dκm representing d/ copies of each y Y. Denote the jth copy of y Y by y (j Y and let Y y = { y (j, j = 1,,..., d/ }. Then let Y 1, Y,..., Y d be a uniform random partition of Y into d sets of size κm. Define ψ : Y Y by ψ (y (j = y for all y Y. Finally, let ψ : ( ( X Y κ X Y κ be such that ψ(ν 1, ν, ξ 1, ξ,..., ξ κ = (ψ 1 (ν 1, ψ 1 (ν, ψ (ξ 1, ψ (ξ,..., ψ (ξ κ. Define p 1 by p = 1 (1 p 1 α where α = e κd. With this choice, we can generate H n,p;k as the union of α independent copies of H n,p1 ;k. Similarly, define p by p 1 = 1 (1 p d. Finally define p 3 by p = 1 (1 p 3 β where β = d (d/ κ. Observe that p i n k 1 / log n for i = 1,, 3 as n. In this way, H n,p;k is represented as the union of dαβ independent copies of H n,p3 ;k. Now let an edge {ν 1, ν, ξ 1, ξ,..., ξ κ } of Γ(X j, Y j, p, 1 j d, be spoiled if ψ 1 (ν 1 = ψ 1 (ν or there exist 1 r < s κ such that ψ (ξ r = ψ (ξ s. Let ˆΓ(X j, Y j, p be obtained from Γ(X j, Y j, p by removing all spoiled edges. As we already mentioned H n,p;k is represented as the union of dαβ independent copies of H n,p3 ;k. We group the dαβ copies of H n,p3 ;k together into α sets A 1, A,..., A α in such a way that each collection A i, 1 i α, consists of d sub-collections B i,j, 1 j d, where B i,j comprises β independent copies of H n,p3 ;k. Let Λ i,j denote the union of these β copies in B i,j and let Σ i denote the union of Λ i,j over all 1 j d. Basically Λ i,j and Σ i can be viewed as copies of H n,p ;k and H n,p1 ;k, respectively. Now for fixed 1 i α and 1 j d, we couple an independent copy of ˆΓ(X j, Y j, p with a sub-hypergraph (induced by ( ( X Y κ of the union of β independent copies of Hn,p3 ;k in B i,j as follows. First we enumerate these β copies of H n,p3 ;k as H j1,...,j k, where 1 j 1, j d and 1 j 3,..., j k d/. Next we place {x 1 < x, y 1 < y < < y κ } in H j1,...,j k, whenever there exist j 1,..., j k such that {x (j 1 1, x (j, y (j 3 1,..., y (j k κ } is an edge in ˆΓ(X j, Y j, p. Fix 1 i α for the moment and consider Λ i,j for all 1 j d. Let M j, 1 j d, be a perfect matching of Γ(X j, Y j, p as promised by Theorem 3. At this point what we can say is that X 1, X,..., X d is a uniform random partition of X and Y 1, Y,..., Y d is a uniform random partition of Y. Furthermore, if M j exists then by symmetry we can assume that it is a uniformly random matching of Γ(X j, Y j, p. What we want though are unspoiled matchings. Fortunately, it is reasonably likely that M j contains no spoiled edges. Our argument will be (see Lemma 5 below that there is a probability of at least e κd that M j ˆΓ(X j, Y j, p simultaneously for all 1 j d. That means that with the same probability ψ(m j Λ i,j simultaneously for all 1 j d, i.e., ψ(m 1 M M d Σ i. It follows that then with probability at least 1 ((1 o(1(1 e κd α 1 e eκd (1 3
4 there is an i such that Σ i contains a copy of the following hypergraph Λ d = ψ(m 1 M M d, where each M j is a random perfect matching of ˆΓ(X j, Y j, p 1, i.e., M j has no spoiled edges. (The first 1 o(1 factor in (1 comes from the use of Theorem 3. We will choose such an i for constructing Λ d. These matchings are still independently chosen, once we have fixed the partitions X 1, X,..., X d and Y 1, Y,..., Y d and each M j is uniformly random from ˆΓ(X j, Y j, p 1 by symmetry. On the other hand, the partitions of X, Y are no longer uniform. Their probability of selection depends on how many unspoiled matchings they contain. Our main auxiliary result, see Theorem 6, shows that the hypergraph Λ d contains a loose Hamilton cycle with probability at least 1 3κ/d. Because we have pn k 1 / log n we can make d arbitrarily large and consequently this and (1 imply that ( lim Pr(H n,p;k has no Hamilton cycle lim e eκd + 3κ = 0. n d d This completes the proof of Theorem. Remark 4 It is important to understand the distribution of Λ d. It is the union of matchings M 1, M,..., M d obtained by repeating the following experiment until the occurrence of U: (i choose uniform random partitions of X, Y; and then (ii choose uniform random matchings M j of Γ(X j, Y j, p. Lemma 5 shows that we should not have to wait too long until U occurs. We do not choose one set of partitions and then choose the matchings conditional on U. 3 Auxiliary results We will use a configuration model type of construction to analyze Λ d (see, e.g., [] or Section 9.1 in [6]. X is represented as dm points partitioned into m cells X x, x X of d points. Analogously Y is represented as dκm points partitioned into κm cells Y y, y Y of d/ points. To construct Λ d we take a random pairing of X into dm sets e 1, e,..., e dm of size two and a random partition f 1, f,..., f dm of Y into dm sets of size κ. The edges of Λ d will be ψ(e l f l for l = 1,,..., md. We condition on U. We will now argue that this model is justified. First of all ignore the event U. To generate M 1, M,..., M d, we can take a random permutation π 1 of X and a random permutation π of Y. We let X j = {π 1 ((j 1m + i, i = 1,..., m} and then M j,x will consist of e l = {π 1 (l 1, π 1 (l} for l = (j 1m + 1,..., jm. We construct the f l and Y j and M j,y in a similar way from π. So π 1, π generate the same hypergraph when viewed either as originally described in terms of M 1, M,..., M d or as described in terms of a configuration model. Each sequence M 1, M,..., M d is equally likely in both models. The relationship between models will therefore continue to hold even if we condition on the event U. As already noted in Remark 4, Λ d is the above model conditioned on the event U. We generate a conditioned sample by repeatedly generating M 1, M,..., M d until the event U occurs. In our 4
5 analysis of the configuration model we deal with U directly. We use a second moment method and compute our moments conditional on U. 3.1 Spoiled edges Suppose that for every 1 j d there exists a perfect matching M j of Γ(X j, Y j, p. We show that it is reasonably likely that M 1 M d contains no spoiled edges. Let U be the event: {M j ˆΓ(X j, Y j, p, for each j = 1,,..., d} = {M 1 M d contains no spoiled edges}. Lemma 5 Suppose that κ 1 and d is a positive even integer. Then, Pr(U M j exists for each j = 1,,..., d exp { d 1 } (κ 1(d e κd. 4 Proof. Our model for M j will be a collection of sets {x j,l 1, x j,l, Z j,l }, where M j,x = {x j,1, x j, },..., {x j,m 1 x j,m } is a random pairing of X j and M j,y = Z j,1, Z j,,..., Z j,m is a random partition of Y j into sets of size κ. We can obtain all of the {x j,l 1, x j,l }, for all j and l, by taking a random permutation of X and then considering it in dm consecutive subsequences I 1, I,..., I dm of length. Let S 1 denote the number of pairs ν 1, ν of elements in X with ψ 1 (ν 1 = ψ 1 (ν that appear in some I l. Similarly, we can obtain all of the the Z j,l by taking a random permutation of Y and then considering it in dm consecutive sub-sequences J 1, J,..., J dm of length κ. Let now S denote the number of pairs ξ 1, ξ of elements in Y with ψ (ξ 1 = ψ (ξ that appear in some J l. Then for any constant t 1, we obtain and ( ( dm d 1 t ( d 1 t E(S 1 (S 1 1 (S 1 t + 1 t!, t dm O(1 ( (( dm κ d/ 1 t ( (κ 1(d t E(S (S 1 (S t + 1 t!. t dκm O(1 4 It follows that S 1 and S are asymptotically Poisson with means (d 1 and (κ 1(d 4, respectively. Now S 1 and S are independent and so S 1 + S is asymptotically Poisson with mean (d 1 + (κ 1(d 4 and as required. Pr(M j ˆΓ(X j, Y j, p, for each j = 1,,..., d M j exists for each j = 1,,..., d = Pr(S 1 + S = 0 M j exists for each j = 1,,..., d { exp d 1 } (κ 1(d 4 e κd, We write A m B m to signify that A m = (1 + o(1b m as m. 5
6 3. Loose Hamilton cycles in random bipartite hypergraphs Recall that X is a set of size dm representing d copies of each x X and Y is a set of size dκm representing d/ copies of each y Y, where X = m and Y = κm. Let X 1, X,..., X d be a uniform random partition of X into d sets of size m and let Y 1, Y,..., Y d be a uniform random partition of Y into d sets of size κm. For every 1 j d, let M j be a random matching of ( X j ( Yj κ conditioned on U i.e. without spoiled edges. That means Mj is a set of m disjoint k-edges in ( X j ( Yj κ such that no edge contains two representatives of the same element of X Y. Let Λ d = ψ(m 1 M d. Theorem 6 Suppose that κ 1 and d is a sufficiently large positive even integer. Then, d Pr(Λ d contains a loose Hamilton cycle (1 + o(1 d (κ κ d. A similar result for κ = 1 was already established by Janson and Wormald [7] using a different terminology. Let H be a random variable which counts the number of loose Hamilton cycles in Λ d such that the edges only intersect in X. Note that every such loose Hamilton cycle induces an ordinary Hamilton cycle of length m in X and a partition of Y into κ-sets. Lemma 7 Suppose that κ 1 and d is a positive even integer. Then, κ(d ((d E(H e (κ+1/ 1(d κ+1 m (d π. d Hence, lim m E(H = for every d > e κ The last conclusion holds since for d > e κ+1 + 1, (d 1(d κ+1 (d d κ+1 (d = (d 1 d κ+1 (d ( 1 κ+1 (d d { (d 1 exp κ + 1 d = (d 1 exp{ (κ + 1} > 1. } (d Lemma 8 Suppose that κ 1 and d is a sufficiently large positive even integer. Then, E(H d (1 + o(1 E(H d (κ + 1. Now Theorem 6 easily follows from this, since Pr(H = 0 Var(H E(H (1 + o(1 d d (κ
7 3..1 Expectation (the proof of Lemma 7 Let a m-cycle in X be a set of m disjoint pairs of points of X such that they form a m-cycle in X (i.e. a Hamilton cycle when they are projected by ψ 1 to X. Let p m be the probability that a given set of m disjoint pairs of points of X forming a m-cycle is contained in a random configuration and that U holds. First note that from the proof of Lemma 5 the number of configurations partioned into m cells of d points for which U holds is asymptotically e (d 1/ (dm 1!! = e (d 1/ (dm! dm (dm! ( After fixing the pairs in a m-cycle we have to randomly pair up (d m points. In other words, we want to compute the number of configurations partioned into m cells of (d points for which U holds. Hence, again by Lemma 5 we get, and e (d 3/ ((d m 1!! p m e (d 3/ ((d m 1!! e (d 1/ (dm 1!! = e (dm 4m 1!!. (dm 1!! Next, let a m be the number of possible m-cycles on X. From (9. in [6] we get, a m = (d(d 1m (m!. 4m Let q m be the probability that a randomly chosen set U of κm points of Y (represented by m κ-sets is equal (after the projection ψ to Y, i.e., ψ (U = Y. Note that U must contain precisely one copy of every element of Y. Hence, we have (d/ κm out of ( κdm κm choices for U. Thus, again by the proof of Lemma 5 we get, Consequently, q m e (κ 1(d 4/4 (d/ κm (κ 1/ (d/κm = e. e (κ 1(d /4( κdm κm ( κdm κm E(H = a m p m q m e (κ+1/ d(κ+1m (d 1 m (m!(dm 4m 1!!(κm!(κdm κm! κm+. m(dm 1!!(κdm! Using the Stirling formula yields Lemma 7. Recall that (N 1!! ( N N. e 3.. Variance (the proof of Lemma 8 Let C 1 and C be two m-cycles in X sharing precisely b pairs. Clearly, C 1 C = 4m b. Denote by p m (b the probability that C 1 and C are contained in a random configuration of X for which U holds. (Clearly, p m (m = p m. First note that if we ignore U then the number of configurations containing C 1 and C equals (dm (4m b 1!! 7
8 Next conditioning on U we obtain that the number of configurations containing C 1 and C is bounded from above by e (d 5/ (dm (4m b 1!! (The factor e (d 5/ corresponds to the case when b = 0. Hence, p m (b (1 + o(1 e (d 5/ (dm (4m b 1!! e (d 1/ (dm 1!! (dm 8m + b 1!! e. (3 (dm 1!! Let U and W be two randomly chosen collections of m κ-sets in Y satisfying W = U = m and W \ U = m b. Let r m (b be the probability that both U and W are both equal (after the projection ψ to Y, i.e., ψ (U = ψ (W = Y. Conditioning on ψ (U = Y we have (d/ 1 κm κb out of ( κdm κm κm κb choices for W. Thus, similarly as in (3 we obtain e (κ 1(d 6/4 (d/ 1 κm κb r m (b (1 + o(1q m e (κ 1/ (d/ 1 κm κb q m. e (κ 1(d 4/4( κdm κm κm κb ( κdm κm κm κb Moreover, let N(b be the number of m-cycles in X that intersect a given m-cycle in b pairs. By [6] (cf. last equation on page 53, we get N(b = min{b,m b} a=0 where for a = b = 0 we set a b = 1. Consequently, E(H E(H 1 m 1 E(H + am b(m b a 1 (d m+a b (d 3 m a b (m b 1! b=0 N(bp m (br m (b a m p m q m 1 m 1 E(H + (1 + o(1 b=0 min{b,m b} a=0 ( ( ( b m b a a a(m b(m b a (d(d 1 m (d m+a b (d 3 m a b ( ( b m b (m b!(dm 8m + b 1!!(dm 1!! (d/ 1 κm κb a a (m!(dm 4m 1!! ( κdm κm κm κb, ( κdm κm (d/ κm. Below we ignore all cases for which a = 0, a = b or a + b = m since their contribution is negligible as can be easily checked by the reader. Using the Stirling formula, the terms in the sum can be written as 1 h(a/(m, b/(m exp{m g(a/(m, b/(m} 4πm where ( ( 1 + O g(x, y = x log( log(d log(d 1 + (1 + x y log(d + (1 x y log(d 3 + y log(y + (1 y log(1 y (y x log(y x x log(x (1 x y log(1 x y 1 min{a, b a, m a b} (d/ + y log(d 4 + y + (d/ log(d (d log(d + κ(d/ 1 log(d + κ(1 y log(1 y + κ(d/ + y log(d 4 + y κ(d 3 + y log(d, 8
9 and h(x, y = d( 4 + d + y (d y(1 y(1 x y(y x. Although the next computations may be verified by hand, the reader might find the assistance of Mathematica useful. We give the definitions of g(x, y and h(x, y in Mathematica format in Appendix A. Now we analyze function g(x, y in the domain First, we compute the first derivatives: S = {(x, y : 0 < x < y < 1 x}. g = log( log(d 3 + log(d log(x + log( x + y + log(1 x y x g = log(d 3 (1 + κ log(d ( + κ log(1 y y + log(1 x y + log(y log( x + y + (1 + κ log(d 4 + y. Let (x 0, y 0 = ((d /(d(d 1, /d. Note that since g x (x 0, y 0 = g y (x 0, y 0 = 0, (x 0, y 0 is a critical point of g and g(x 0, y 0 = 0. Let D g be the Hessian matrix of second derivatives. Routine calculations show that Hence, D g(x, y = One can verify that ( x + 1 D g(x 0, y 0 = x y x+y 1 x+y x+y ( (d 1 d (d 3 (d 4(d 1 d (d (d 3 1 x+y x+y +κ 1 y + 1 x y + 1 y x+y + (d 4(d 1 d (d (d 3 d(16+d( 34+d(8+( 9+dd κ+6κ (d 3(d Det(D g(x 0, y 0 = d3 (d 1 (d (1 + κ 4(d 3(d. (1+κ 4+d+y Since (d 1 d (d 3 < 0 and Det(D g(x 0, y 0 > 0 for d > (1 + κ, we conclude that D g(x 0, y 0 is negative definite at (x 0, y 0. Hence, g has a local maximum there. Now we show that (x 0, y 0 is the unique global maximum point of g in S. Moreover, we argue that that g(x, y has no asymptote near the boundary of S, nor does it approach a limit which is greater than 0 (for d large enough. First recall that the function f(z = { z log(z if 0 < z < 1, 0 if z = 0 or z = 1 (4 is continuous on [0, 1]. Consequently, function g(x, y can be extended to a continuous function on T = {(x, y : 0 x y 1 x}. 9
10 Note that 1/e f(z 0 (cf. (4. Thus, g(x, y log( log(d log(d 1 + (1 + x y log(d + (1 x y log(d /e + /e + 1/e + (d/ + y log(d + (d/ log(d (d log(d + κ(d/ 1 log(d κ(d/ + y log(d κ(d 3 + y log(d = y log(d + o(log(d, where the last term o(log(d does not depend on x and y. Hence, there is a large enough d such that g(x, y < 0 for all points in the domain {(x, y T : 1/(3 + κ y}. Denote by T the boundary of T, i.e., T = T \ S. In order to finish, it is enough to show that: (i the only critical point in {(x, y T \ T : y 1/(3 + κ} is (x 0, y 0, and (ii g(x, y < 0 for all points in {(x, y T : y 1/(3 + κ}. Solving the equation g y (x, y = 0 for x, noting that the equation is linear in x, we obtain x = y(1 y ( (d 3(d κ+1 (1 y κ+1 (d 4 + y κ+1 (1 y κ+ (d 3(d κ+1 y(d 4 + y κ+1. Substituting this expression for x in g g x (x, y = 0 (actually in exp{ x (x, y} = 1 yields the equation 0 = ψ(y = (1 y (1 y κ (d 4 + y κ+1 (d κ+ y(1 y κ+ (6 5d + d (d κ + y(1 y κ+1 (d 4 + y 1+κ (d 3(d κ+1 y(d 4 + y +κ. We see from our previous considerations that ψ(y 0 = 0. It remains to show that for large d, y 0 is the only value in {y : 0 < y 1/(3 + κ} for which ψ(y = 0. To this end we show that ψ (y < 0 implying that ψ(y is a monotone function (and clearly also continuous. From the definition of ψ(y we get, ψ (y = ( y(1 y κ+ (6 5d + d (d κ + O(d κ+3 = (1 y κ+1 ( 1 + y(κ + 3d κ+4 + O(d κ+3, where the hidden constant in O(d κ+3 does not depend on y. Hence, for a sufficiently large d the derivative ψ (y < 0 for all 0 < y 1/(3 + κ (independently from d. This shows that (i holds. We split (ii into three cases. One is for 0 = x < y, one for 0 < x = y and the last one for 10
11 x = y = 0. Note that g 1 (y = g(0, y = log(d log(d 1 + (1 y log(d + (1 y log(d 3 + (1 y log(1 y (1 y log(1 y + (d/ + y log(d 4 + y + (d/ log(d (d log(d + κ(d/ 1 log(d + κ(1 y log(1 y + κ(d/ + y log(d 4 + y κ(d 3 + y log(d. Recall that 0 < y < 1/(3 + κ. It is easy to check that g 1(y = log(d + o(log(d, where the last term o(log(d does not dependent on y. a decreasing function. Hence, by continuity Thus, for d sufficiently large g 1 (y is g 1 (y g 1 (0 = g(0, 0. Later we show that g(0, 0 < 0. Now let 0 < x = y 1/(3 + κ. Define g (y = g(y, y = y log( log(d log(d 1 + log(d Consequently, + (1 y log(d 3 + y log(y + (1 y log(1 y y log(y (1 y log(1 y + (d/ + y log(d 4 + y + (d/ log(d (d log(d + κ(d/ 1 log(d + κ(1 y log(1 y + κ(d/ + y log(d 4 + y κ(d 3 + y log(d. g (y = log( log(d 3 κ log(d + log(1 y (+κ log(1 y log(y+(1+κ log(d 4+y and g (y = ( + κ/(1 y 1/y + 4/( 1 + y + (1 + κ/(d 4 + y. Note that since 0 < y 1/(3 + κ we get that for d large enough g (y < 0. Thus, g (y is a decreasing function. Moreover, since and lim y 0 g (y = + g (/d = log((d 4/(d 3 < 0, we conclude that g (y has a local maximum at ξ (0, /d]. Clearly such local maximum is the global maximum in the interval (0, 1/(3 + κ]. Unfortunately, it is not clear how to determine ξ since the equation g (y = 0 seems not to have any nice solution. Therefore, we define a new auxiliary function g 3 (y = g (y (/3(d/ log((d 4/(d 3y 3 11
12 on (0, /d]. Clearly g (y g 3 (y. Thus in order to show that g (ξ < 0, it suffices to prove that g 3 (y < 0 for any y (0, /d]. Analogously to analyzing g (y one can show that g 3 (y < 0 for d large enough. Moreover, since g 3 (/d = 0, we get that g 3(y is an increasing function on (0, /d]. Thus, g 3 (y g 3 (/d = (8/3d 1 log((d 4/(d 3 + log((d /(d 1. (5 As one can check the right hand side in (5 is negative for sufficiently large d, as required. It remains to show that g(0, 0 < 0. By continuity we get g(0, 0 = lim y 0 + g (y g 3 (/d < 0. This completes the proof of (ii and so the proof of showing that (x 0, y 0 is the unique global maximum in T. The rest of argument is totally standard for such variance calculations (see, e.g., [5, 6]. Finally, we obtain E(H 1 (1 + o(1 h(x E(H 0, y 0 exp { 1 } π (z 1, z D g(x 0, y 0 (z 1, z T dz 1 dz h(x 0, y 0 Det(D g(x 0, y 0 1/ as required. (d 1d = (d d 3 (d d 3 (d 1 d 3 (d (1 + κ d = d (κ + 1, 4 Concluding remarks In this paper, we showed that (log n/n k 1 is the asymptotic threshold for the existence of loose Hamilton cycles in H n,p;k for n a multiple of (k 1. It would be nice to drop this divisibility requirement and replace it by the necessary (k 1 n, as mentioned in Introduction. We address this question in our future work. 5 Acknowledgment We would like to thank the anonymous referee for carefully reading this manuscript, many helpful comments and pointing out some errors in the previous version of this manuscript. We are also very grateful to Svante Janson and Nick Wormald for fruitful discussions about contiguity of random regular graphs (contiguity was used in the previous version of this paper. 1
13 References [1] M. Ajtai, J. Komlós and E. Szemerédi, The first occurrence of Hamilton cycles in random graphs, Annals of Discrete Mathematics 7 (1985, [] B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics 1 (1980, [3] B. Bollobás, The evolution of sparse graphs, in Graph Theory and Combinatorics, Academic Press, Proceedings of Cambridge Combinatorics, Conference in Honour of Paul Erdős (B. Bollobás; Ed (1984, [4] A.M. Frieze, Loose Hamilton cycles in random 3-uniform hypergraphs, Electronic Journal of Combinatorics 17 (010, N8. [5] A.M. Frieze, M. Jerrum, M. Molloy, R. Robinson and N. Wormald, Generating and counting Hamilton cycles in random regular graphs, Journal of Algorithms 1 (1996, [6] S. Janson, T. Luczak and A. Ruciński, Random Graphs, Wiley, 000. [7] S. Janson and N. Wormald, Rainbow Hamilton cycles in random regular graphs, Random Structures Algorithms 30 (007, [8] A. Johansson, J. Kahn and V. Vu, Factors in random graphs, Random Structures and Algorithms 33 (008, 1 8. [9] J. Komlós and E. Szemerédi, Limit distributions for the existence of Hamilton circuits in a random graph, Discrete Mathematics 43 (1983, A Mathematica expressions For convenience, we replace here κ by k. g[x_,y_,d_,k_] = x Log[] - Log[d] - Log[d - 1] + (1 + x - y Log[d - ] \ + (1 - x - y Log[d - 3] + y Log[y] + (1 - y Log[1 - y] \ - (y - x Log[y - x] - x Log[x] - (1 - x - y Log[1 - x - y] \ + (d/ - + y Log[d y] + (d/ Log[d] - (d - Log[d - ] \ + k(d/ - 1 Log[d] + k(1 - y Log[1 - y] + k(d/ - + y Log[d y] \ - k(d y Log[d - ]; h[x_,y_,d_] = Sqrt[d(-4 + d + y] / Sqrt[(d-^ y(1-y(1 - x - y(y-x]; 13
Adding 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 informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
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 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 informationHAMILTON CYCLES IN RANDOM REGULAR DIGRAPHS
HAMILTON CYCLES IN RANDOM REGULAR DIGRAPHS Colin Cooper School of Mathematical Sciences, Polytechnic of North London, London, U.K. and Alan Frieze and Michael Molloy Department of Mathematics, Carnegie-Mellon
More informationSIZE-RAMSEY NUMBERS OF CYCLES VERSUS A PATH
SIZE-RAMSEY NUMBERS OF CYCLES VERSUS A PATH ANDRZEJ DUDEK, FARIDEH KHOEINI, AND PAWE L PRA LAT Abstract. The size-ramsey number ˆRF, H of a family of graphs F and a graph H is the smallest integer m such
More informationRainbow 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 informationEmbedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity
Embedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity ANDRZEJ DUDEK 1 ALAN FRIEZE 2 ANDRZEJ RUCIŃSKI3 MATAS ŠILEIKIS4 1 Department of Mathematics, Western Michigan University,
More informationRainbow Connection of Random Regular Graphs
Rainbow Connection of Random Regular Graphs Andrzej Dudek Alan Frieze Charalampos E. Tsourakakis November 11, 2013 Abstract An edge colored graph G is rainbow edge connected if any two vertices are connected
More informationRainbow 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 informationSmall subgraphs of random regular graphs
Discrete Mathematics 307 (2007 1961 1967 Note Small subgraphs of random regular graphs Jeong Han Kim a,b, Benny Sudakov c,1,vanvu d,2 a Theory Group, Microsoft Research, Redmond, WA 98052, USA b Department
More informationAsymptotic enumeration of sparse uniform linear hypergraphs with given degrees
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees Vladimir Blinovsky Instituto de atemática e Estatística Universidade de São Paulo, 05508-090, Brazil Institute for Information
More informationSharp threshold functions for random intersection graphs via a coupling method.
Sharp threshold functions for random intersection graphs via a coupling method. Katarzyna Rybarczyk Faculty of Mathematics and Computer Science, Adam Mickiewicz University, 60 769 Poznań, Poland kryba@amu.edu.pl
More informationRainbow Connection of Random Regular Graphs
Rainbow Connection of Random Regular Graphs Andrzej Dudek Alan Frieze Charalampos E. Tsourakakis arxiv:1311.2299v3 [math.co] 2 Dec 2014 February 12, 2018 Abstract An edge colored graph G is rainbow edge
More informationRandom regular graphs. Nick Wormald University of Waterloo
Random regular graphs Nick Wormald University of Waterloo LECTURE 5 Random regular graphs What are they (models) Typical and powerful results Handles for analysis One or two general techniques Some open
More informationGenerating and counting Hamilton cycles in random regular graphs
Generating and counting Hamilton cycles in random regular graphs Alan Frieze Mark Jerrum Michael Molloy Robert Robinson Nicholas Wormald 1 Introduction This paper deals with computational problems involving
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 informationON SUBGRAPH SIZES IN RANDOM GRAPHS
ON SUBGRAPH SIZES IN RANDOM GRAPHS Neil Calkin and Alan Frieze Department of Mathematics, Carnegie Mellon University, Pittsburgh, U.S.A. and Brendan D. McKay Department of Computer Science, Australian
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 informationRandom Graphs. Research Statement Daniel Poole Autumn 2015
I am interested in the interactions of probability and analysis with combinatorics and discrete structures. These interactions arise naturally when trying to find structure and information in large growing
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 informationThe number of Euler tours of random directed graphs
The number of Euler tours of random directed graphs Páidí Creed School of Mathematical Sciences Queen Mary, University of London United Kingdom P.Creed@qmul.ac.uk Mary Cryan School of Informatics University
More informationAvoider-Enforcer games played on edge disjoint hypergraphs
Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing
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 informationOn the threshold for k-regular subgraphs of random graphs
On the threshold for k-regular subgraphs of random graphs Pawe l Pra lat Department of Mathematics and Statistics Dalhousie University Halifax NS, Canada Nicholas Wormald Department of Combinatorics and
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 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 informationBalanced Allocation Through Random Walk
Balanced Allocation Through Random Walk Alan Frieze Samantha Petti November 25, 2017 Abstract We consider the allocation problem in which m (1 ε)dn items are to be allocated to n bins with capacity d.
More informationAsymptotic enumeration of sparse uniform linear hypergraphs with given degrees
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees Vladimir Blinovsky Instituto de atemática e Estatística Universidade de São Paulo, 05508-090, Brazil Institute for Information
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 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 informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More 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 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 informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More 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 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 informationA RANDOM VARIANT OF THE GAME OF PLATES AND OLIVES
A RANDOM VARIANT OF THE GAME OF PLATES AND OLIVES ANDRZEJ DUDEK, SEAN ENGLISH, AND ALAN FRIEZE Abstract The game of plates and olives was originally formulated by Nicolaescu and encodes the evolution of
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 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 informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationPacking tight Hamilton cycles in 3-uniform hypergraphs
Packing tight Hamilton cycles in 3-uniform hypergraphs Alan Frieze Michael Krivelevich Po-Shen Loh Abstract Let H be a 3-uniform hypergraph with n vertices. A tight Hamilton cycle C H is a collection of
More informationThe Chromatic Number of Random Regular Graphs
The Chromatic Number of Random Regular Graphs Dimitris Achlioptas 1 and Cristopher Moore 2 1 Microsoft Research, Redmond, WA 98052, USA optas@microsoft.com 2 University of New Mexico, NM 87131, USA moore@cs.unm.edu
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 informationThe cover time of sparse random graphs.
The cover time of sparse random graphs Colin Cooper Alan Frieze May 29, 2005 Abstract We study the cover time of a random walk on graphs G G n,p when p = c n, c > 1 We prove that whp the cover time is
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 informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1+o(1))2 ( 1)/2.
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 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 informationSets that are connected in two random graphs
Sets that are connected in two random graphs Michael Molloy August 17, 2012 Abstract We consider two random graphs G 1, G 2, both on the same vertex set. We ask whether there is a non-trivial set of vertices
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 informationSZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS
SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS ALEXANDER SCOTT Abstract. Szemerédi s Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of
More 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 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 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 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 informationMonochromatic Boxes in Colored Grids
Monochromatic Boxes in Colored Grids Joshua Cooper, Stephen Fenner, and Semmy Purewal October 16, 008 Abstract A d-dimensional grid is a set of the form R = [a 1] [a d ] A d- dimensional box is a set of
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationBALANCING GAUSSIAN VECTORS. 1. Introduction
BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors
More informationCourse Notes. Part IV. Probabilistic Combinatorics. Algorithms
Course Notes Part IV Probabilistic Combinatorics and Algorithms J. A. Verstraete Department of Mathematics University of California San Diego 9500 Gilman Drive La Jolla California 92037-0112 jacques@ucsd.edu
More informationThe large deviation principle for the Erdős-Rényi random graph
The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite
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 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 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 informationEMBEDDING SPANNING BOUNDED DEGREE SUBGRAPHS IN RANDOMLY PERTURBED GRAPHS
EMBEDDING SPANNING BOUNDED DEGREE SUBGRAPHS IN RANDOMLY PERTURBED GRAPHS JULIA BÖTTCHER*, RICHARD MONTGOMERY, OLAF PARCZYK, AND YURY PERSON Abstract. We study the model G α G(n, p) of randomly perturbed
More informationMINORS IN RANDOM REGULAR GRAPHS
MINORS IN RANDOM REGULAR GRAPHS NIKOLAOS FOUNTOULAKIS, DANIELA KÜHN AND DERYK OSTHUS Abstract. We show that there is a constant c so that for fixed r 3 a.a.s. an r-regular graph on n vertices contains
More informationOn the chromatic number of random graphs with a fixed degree sequence
On the chromatic number of random graphs with a fixed degree sequence Alan Frieze Michael Krivelevich Cliff Smyth December 13, 006 Abstract Let d = 1 d 1 d d n be a non-decreasing sequence of n positive
More informationk-regular subgraphs near the k-core threshold of a random graph
-regular subgraphs near the -core threshold of a random graph Dieter Mitsche Michael Molloy Pawe l Pra lat April 5, 208 Abstract We prove that G n,p=c/n w.h.p. has a -regular subgraph if c is at least
More informationEquitable coloring of random graphs
Michael Krivelevich 1, Balázs Patkós 2 1 Tel Aviv University, Tel Aviv, Israel 2 Central European University, Budapest, Hungary Phenomena in High Dimensions, Samos 2007 A set of vertices U V (G) is said
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
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 informationChordal Graphs, Interval Graphs, and wqo
Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
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 informationMore complete intersection theorems
More complete intersection theorems Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting
More informationGenerating random regular graphs quickly
Generating raom regular graphs quickly A. S T E G E R a N. C. W O R M A L D Institut für Informatik, Technische Universität München, D-8090 München, Germany Department of Mathematics a Statistics, University
More informationThe typical structure of sparse K r+1 -free graphs
The typical structure of sparse K r+1 -free graphs Lutz Warnke University of Cambridge (joint work with József Balogh, Robert Morris, and Wojciech Samotij) H-free graphs / Turán s theorem Definition Let
More informationRANDOM GRAPHS. Joel Spencer ICTP 12
RANDOM GRAPHS Joel Spencer ICTP 12 Graph Theory Preliminaries A graph G, formally speaking, is a pair (V (G), E(G)) where the elements v V (G) are called vertices and the elements of E(G), called edges,
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 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 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 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 informationAlmost all graphs with 2.522n edges are not 3-colorable
Almost all graphs with 2.522n edges are not 3-colorable Dimitris Achlioptas optas@cs.toronto.edu Michael Molloy molloy@cs.toronto.edu Department of Computer Science University of Toronto Toronto, Ontario
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationThe critical window for the classical Ramsey-Turán problem
The critical window for the classical Ramsey-Turán problem Jacob Fox Po-Shen Loh Yufei Zhao Abstract The first application of Szemerédi s powerful regularity method was the following celebrated Ramsey-Turán
More informationSZEMERÉDI S REGULARITY LEMMA 165
SZEMERÉDI S REGULARITY LEMMA 165 9.4 SZEMERÉDI S REGULARITY LEMMA In this section we describe a fundamental result, the Regularity Lemma, proved by Endre Szemerédi in the 70s. The original motivation for
More informationPacking chromatic number of subcubic graphs
Packing chromatic number of subcubic graphs József Balogh Alexandr Kostochka Xujun Liu arxiv:1703.09873v2 [math.co] 30 Mar 2017 March 31, 2017 Abstract A packing k-coloring of a graph G is a partition
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 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 informationEXACT MINIMUM CODEGREE THRESHOLD FOR K 4 -FACTORS. MSC2000: 5C35, 5C65, 5C70. Keywords: Tiling, Hypergraphs, Absorbing method.
EXACT MINIMUM CODEGREE THRESHOLD FOR K 4 -FACTORS JIE HAN, ALLAN LO, ANDREW TREGLOWN AND YI ZHAO Abstract. Given hypergraphs F and H, an F -factor in H is a set of vertex-disjoint copies of F which cover
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 informationarxiv: v1 [math.co] 22 Aug 2014
An algorithmic framework for obtaining lower bounds for random Ramsey problems Rajko Nenadov 1 Yury Person Nemanja Škorić1 Angelika Steger 1 rnenadov@inf.ethz.ch person@math.uni-frankfurt.de nskoric@inf.ethz.ch
More informationIndependence and chromatic number (and random k-sat): Sparse Case. Dimitris Achlioptas Microsoft
Independence and chromatic number (and random k-sat): Sparse Case Dimitris Achlioptas Microsoft Random graphs W.h.p.: with probability that tends to 1 as n. Hamiltonian cycle Let τ 2 be the moment all
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 informationRandom Graphs III. Y. Kohayakawa (São Paulo) Chorin, 4 August 2006
Y. Kohayakawa (São Paulo) Chorin, 4 August 2006 Outline 1 Outline of Lecture III 1. Subgraph containment with adversary: Existence of monoχ subgraphs in coloured random graphs; properties of the form G(n,
More informationGRAPHS CONTAINING TRIANGLES ARE NOT 3-COMMON
GRAPHS CONTAINING TRIANGLES ARE NOT 3-COMMON JAMES CUMMINGS AND MICHAEL YOUNG Abstract. A finite graph G is k-common if the minimum (over all k- colourings of the edges of K n) of the number of monochromatic
More informationEquivalence of the random intersection graph and G(n, p)
Equivalence of the random intersection graph and Gn, p arxiv:0910.5311v1 [math.co] 28 Oct 2009 Katarzyna Rybarczyk Faculty of Mathematics and Computer Science, Adam Mickiewicz University, 60 769 Poznań,
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 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 information