Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
|
|
- Kimberly McCoy
- 5 years ago
- Views:
Transcription
1 Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees Vladimir Blinovsky Instituto de atemática e Estatística Universidade de São Paulo, , Brazil Institute for Information Transmission Problems Russian Academy of Sciences, oscow 17994, Russia vblinovs@yandex.ru Catherine Greenhill School of athematics and Statistics UNSW Australia Sydney NSW 05, Australia c.greenhill@unsw.edu.au September 014 Abstract A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. n 3, let r = rn) 3 be an integer and let k = k 1,..., k n ) be a vector of nonnegative integers, where each k j = k j n) may depend on n. Let = n) = n j=1 k j for all n 3, and define the set I = {n 3 rn) divides n)}. We assume that I is infinite, and perform asymptotics as n tends to infinity along I. Our main result is an asymptotic enumeration formula for linear r-uniform hypergraphs with degree sequence k. This formula holds whenever the maximum degree k max satisfies r 5 k 4 max = o). A new asymptotic enumeration formula for simple uniform hypergraphs with specified degrees is also presented, which holds when r 4 k 3 max = o). The proof focuses on the incidence matrix of a hypergraph, interpreted as a bipartite graph, and combines known enumeration results for bipartite graphs with a switching argument. Research supported by the Australian Research Council. For 1
2 1 Introduction Hypergraphs are combinatorial structures which can model very general relational systems, including some real-world networks [5, 6, 9]. Formally, a hypergraph or a set system is defined as a pair V, E), where V is a finite set and E is a multiset of multisubsets of V. We refer to elements of E as edges.) Note that under this definition, a hypergraph may contain repeated edges and an edge may contain repeated vertices. Any -element multisubset of an edge e E is called a link in e. If a vertex v has multiplicity at least in the edge e, we say that v is a loop in e. So every loop in e is also a link in e.) The multiplicity of a link {x, y} is the number of edges in E which contain {x, y} counting multiplicities). A hypergraph is simple if it has no loops and no repeated edges: that is, E is a set of edges, and each edge is a subset of V. Here it is possible that distinct edges may have more than one vertex in common. This definition of simple hypergraph appears to be standard, and matches the definition of simple hypergraphs given by Berge [1] in the case of uniform hypergraphs.) A hypergraph is called linear if it has no loops and each pair of distinct edges intersect in at most one vertex. Note that linear hypergraphs are also simple.) For a positive integer r, the hypergraph V, E) is r-uniform if each edge e E contains exactly r vertices counting multiplicities). Uniform hypergraphs are a particular focus of study, not least because a -uniform hypergraph is precisely a graph. We seek an asymptotic enumeration formula for the number of linear r-uniform hypergraphs with a given degree sequence, when the maximum degree is not too large the sparse range), and allowing r to grow slowly with n. To state our result precisely, we need some definitions. Write [a] = {1,,..., a} for all positive integers a. Given nonnegative integers a, b, let a) b denote the falling factorial aa 1) a b + 1). We are given a degree sequence k = kn) = k 1,..., k n ) with sum = n) = n i=1 k i, and we are also given an integer r = rn) 3, for each n 3. For each positive integer t, define n t = t n) = k i ) t. Then 1 = and t k max t 1 for t. Let H r k) denote the set of simple r-uniform hypergraphs on the vertex set [n] with degree sequence given by k = k 1,..., k n ), and let L r k) be the set of all linear hypergraphs in H r k). Note that H r k) and L r k) are both empty unless r divides. Our main theorem is the following. i=1
3 Theorem 1.1. For n 3, let r = rn) 3 be an integer and let k = k 1,..., k n ) be a vector of nonnegative integers, where each k j = k j n) may depend on n. Let = n) = n j=1 k j for all n 3, and suppose that the set I = {n 3 rn) divides n)} is infinite. Let k max = k max n) = max n j=1 k j for all n 3. If and r 5 k 4 max = o) as n tends to infinity along elements of I, then! L r k) = /r)! r!) /r n i=1 k i! exp r 1) r 1) + O r 5 k 4 max/ ) ) 4. When r =, our result is weaker than ckay and Wormald [15] as their expression has smaller error term and more significant terms. However, we believe that our result is the first asymptotic enumeration for r-uniform linear hypergraphs with r 3, and the first enumeration result for sparse r-uniform hypergraphs which allows r to grow with n. In order to improve the accuracy of Theorem 1.1, a much more detailed analysis of double links is required. We will present such an analysis in a future paper. A brief survey of the relevant literature is given in the next subsection. In Section we outline our approach, which is to use the incidence matrix of a hypergraph and prior enumeration results for bipartite graphs in order to enumerate linear hypergraphs. First we show that some undesirable substructures are rare in random bipartite graphs with the appropriate degrees. As a corollary of this, we obtain a new enumeration result for sparse simple uniform hypergraphs. Theorem 1.1 then follows from a switching argument for bipartite graphs which is used to remove subgraphs isomorphic to K,, as these correspond to double links in the hypergraph. This switching argument is presented in Section History In the case of graphs, the best asymptotic formula in the sparse range is given by ckay and Wormald [15]. See that paper for further history of the problem. The dense range was treated in [1, 14], but there is a gap between these two ranges in which nothing is known. An early result in the asymptotic enumeration of hypergraphs was given by Cooper et al. [3], who considered simple k-regular r-uniform hypergraphs when k, r = O1). Recently, Dudek et al. [4] proved an asymptotic formula for simple k-regular r-uniform hypergraphs with k = on 1/ ) and r = O1). An asymptotic enumeration formula for sparse simple uniform hypergraphs with irregular degree sequences was given in []. We restate this result below. 3
4 Theorem 1.. [, Theorem 1.1] Let r 3 be a fixed integer and define 1 if r {3, 4, 5, 6}, η = ηr) = 0 otherwise. Let k, and k max be defined as in Theorem 1.1. Assume that r divides for infinitely many values of n, and and kmax +η = o) as n tends to infinity along these values. Then ) H r k) =! /r)! r!) /r n i=1 k i! exp r 1) + Ok+η max/) For an asymptotic formula for the number of dense simple r-uniform hypergraphs with a given degree sequence, see [10]. As far as we are aware, there are no prior asymptotic enumeration results for uniform linear hypergraphs when r 3.. Hypergraphs, incidence matrices and bipartite graphs Suppose that G is an r-uniform hypergraph with degree sequence k which has no loops but may have repeated edges). Let A be the n /r) incidence matrix of G, where the rows of the incidence matrix correspond to vertices 1,,... n in that order, and the columns correspond to the edges of the hypergraph, in some order. Then A is a 0-1 matrix as G has no loops), the row sums of A are given by k and each column sum of A equals r. If G is simple that is, if G H r k)) then all columns of A are distinct, and hence there are precisely /r)! possible distinct) incidence matrices corresponding to G. Conversely, every 0-1 matrix with rows sums given by k, column sums all equal to r and with no repeated columns can be interpreted as the incidence matrix of a hypergraph in H r k). It will be convenient to work with the bipartite graphs whose adjacency matrices are the incidence matrices of hypergraphs. Let B r 0) k) be the set of bipartite graphs with vertex bipartition {v 1,..., v n } {e 1, e,..., e /r }, such that degree sequence of v 1,..., v n ) is k and every vertex e j has degree r. We sometimes say that a vertex v j is on the left and that a vertex e i is on the right. An example of a 3-uniform hypergraph, its incidence matrix with edges ordered in lexicographical order) and corresponding bipartite graph is shown in Figure 1. Double links will be of particular interest: there are two double links in the hypergraph in Figure 1, and each corresponds to a subgraph of the bipartite graph which is isomorphic to K,. One is induced by {v 1, v, e 1, e } and the other by {v 5, v 6, e 3, e 4 }.) 4
5 v 1 e v v 3 v 4 v 5 e e 3 v 6 e 4 Figure 1: A hypergraph, its incidence matrix and corresponding bipartite graph. It follows from [8, Theorem 1.3] that B 0) r =! r!) /r n j=1 k j! exp r 1) ) + Or kmax/).1) whenever 1 rk max = o 1/ ). In fact, the result of [8] is more accurate but we are unable to exploit the extra accuracy here, so we state a simplified version.) Next, let B r k) denote the set of all bipartite graphs in B r 0) k) such that no two vertices e i1, e i on the right) have the same neighbourhood. These bipartite graphs correspond to 0-1 matrices with no repeated columns, which in turn can be viewed as incidence matrices of simple) hypergraphs in H r k). Hence /r)! H r k) = B r k)..) To work towards linear hypergraphs, we identify some desirable properties of the corresponding bipartite graphs. Given positive integers a, b, say that the bipartite graph B has a copy of K a,b if B contains K a,b as an induced subgraph. Define N = 3 max { log, r 1) / } and let B r + k) denote the set of all bipartite graphs B B r 0) properties: which satisfy the following i) B has no copy of K 3,. ii) B has no copy of K,3. 5
6 iii) No two copies of K, have a vertex e j on the right) in common. This implies that any two copies of K, in B are edge-disjoint.) iv) Any three copies of K, in B involve at least five vertices on the left. That is, at most two of the three copies of K, can share a common vertex.) v) There are at most N edge-disjoint copies of K, in B. To motivate this definition, note that B B r + k) if and only if the corresponding hypergraph G = GB) satisfies the following properties: i) ii) iii) iv) The intersection of any two edges of G contains at most two vertices. Any link has multiplicity at most two in G. That is, the intersection of any three edges of G contains at most one vertex.) No edge of G contains more than one double link. That is, if e 1 and e are edges of G which share a double link then e 1 is not involved in any other double link in G, and similarly for e.) No vertex can belong to three double links, and if a vertex v belongs to two double links say {v, x} and {v, y} are both double links) then both x and y belong to precisely one double link. v) There are at most N double links in G. In particular, as r 3, any hypergraph G = GB) with B B r + k) has no loops and) no repeated edges, so is simple. ckay [11] proved asymptotic formulae for the probability that a randomly chosen bipartite graph with specified degrees contains a fixed subgraph, under certain conditions. We state one of these results below, which will be use repeatedly. In fact the statement below is a special case of [11, Theorem 3.5a)], obtained by taking J = L and H = in the notation of [11], and with slightly simplified notation.) Lemma.1. [11, Theorem 3.5a)]) Let Bg) denote the set of bipartite graphs with vertex bipartition is given by I = {1,..., n} {1,..., m } and degree sequence g = g 1,..., g n ; g 1,..., g m ). Here vertex i has degree g i for i = 1,..., n, and vertex j has degree g j for j = 1,..., n.) Let L be a subgraph of the complete bipartite graph on this vertex bipartition, and let Bg, L) 6
7 be the set of bipartite graphs in Bg) which contain L as a subgraph. Write E g = n i=1 g i and E l = n i=1 l i, where l = l 1,..., l n ; l 1,..., l m) is the degree sequence of L. Finally, let g max and l max denote the maximum degree in g and l, respectively, and define Γ = g max g max + l max 1) +. If E g Γ E l then Bg, L) Bg) i I g i) li E g Γ) El. Using this lemma, we now analyse the probability that a uniformly random element of B r 0) k) satisfies properties i) v). Theorem.. Under the conditions of Theorem 1.1, B r +! k) = r!) /r n i=1 k i! exp r 1) ) + Or5 kmax/) 4. Proof. Throughout this proof, consider a uniformly random element B B r 0) k). We will apply Lemma.1 several times with g = k 1,..., k n ; r,..., r). In each application, L is a subgraph with constant maximum degree. Hence g max = max{k max, r} and Γ = g max g max + l max 1) + = Or + k max). For i), let v j1, v j, v j3 [n] be distinct vertices on the left, and let e i1, e i be distinct vertices on the right. Applying Lemma.1 with L = K 3,, we find that the probability that B has a copy of K 3, on the vertices {v j1, v j, v j3 } {e i1, e i1 } is at most r r 1) r ) + Or + k max)) 6 k j1 ) k j ) k j3 ). By assumption, k max + r = o). ultiplying this by the number of choices for {e i1, e i } and summing over all choices of j 1, j, j 3 ) with 1 j 1 < j < j 3 n shows that the expected number of copies of K 3, in B is at most ) /r ) r 6 k j1 ) k j ) k j3 ) O 6 j 1 <j <j 3 ) r 4 3 = O 4 = Or 4 k 3 max/)..3) 7
8 Hence property i) fails with probability Or 4 k 3 max/). For future reference, we note that.3) still holds under the weaker condition r 4 k 3 max = o). Next we prove that property ii) holds with high probability. Arguing as above using Lemma.1 with L = K,3 shows that the expected number of copies of K,3 in B is at most ) r 3 3 O = Or 3 k max/). 4.4) 3 To show that property iii) is likely to hold, consider the subgraph L which consists of a copy of K, on the vertices {v j1, e i1, v j, e i } and a copy of K, on the vertices {v j3, e i, v j4, e i3 }, where {j 1, j } and {j 3, j 4 } are two pairs of distinct vertices on the left, and e i1, e i, e i3 are distinct vertices on the right. If {j 1, j } {j 3, j 4 } = 1 then the two copies of K, share a common edge. By Lemma.1, the expected number of such subgraphs in B is ) r 4 3 O = Or 4 kmax/), 4.5) 4 since L has 7 edges in this case. However, when {j 1, j } {j 3, j 4 } = the subgraph L has 8 edges and the expected number of such subgraphs is, by Lemma.1, ) r 5 4 O = Or 5 k max/). 4.6) 5 This case can only arise if r 4, but it does not hurt to use this error bound when r = 3 since then it is Ok 4 max/), matching the bound from.4).) We now show that iv) holds with high probability. By iii), we need only consider sets of three edge-disjoint copies of K, with at most 4 vertices on the left. By considering cases and applying Lemma.1, the expected number of such sets is ) r 6 kmax 8 O = Ork max/), 4.7) which is sufficiently small. As a representative example, suppose that the three copies of K, all share one common vertex on the left, with no other vertex coincidences. The expected number of sets of three copies of K, with this property is Or / 6 ) = Or 6 k 8 max/ ), as claimed. It remains to observe that there are only a constant number of cases to consider.) Now we turn to v). Let Q 1 = max { log, r 1) / } and define a = Q We first show that the expected number of sets of a vertex-disjoint copies of K, in B is O1/). Fix j 1,..., j a ) [n] a such that k jl 8 for l = 1,,..., a
9 and j l 1 j l for l = 1,,..., a. Let i 1,..., i a ) {1,..., /r} a be a a)-tuple of distinct) edge labels. The probability that there is a copy of K, on {v jl 1, v jl } {e il 1, e il } for l = 1,..., a is rr 1)) a O 4a ) a l=1 k jl ), by Lemma.1. There are at most /r) a choices for i 1,..., i a ), and for an upper bound we can sum over all possible values of j 1,..., j a ). This counts each set of a vertex-disjoint copies of K, precisely 4 a a! times. From any suitable pair j 1,..., j a ), i 1,..., i a )), the two vertices on the left of each K, may be permuted and the two vertices on the right of each K, may be permuted; furthermore the a copies of K, may be permuted.) It follows that the expected number of sets of a vertex-disjoint copies of K, in B is a ) ) r 1) a 1 r 1) a ) k jl ) O = O 4 a a! a a! 4 j 1,...,j a ) [n] a l=1 ) e r 1) a ) = O 4a by choice of a. Next, let = O e/8) a ) Q = max { log, r 1) 4 4 / 4 } = O1/).8) and define b = Q + 1. From iii) and iv), we can assume that any copy of K, in B is either vertex-disjoint from all other copies of K, in B, or shares one vertex on the left with precisely one other copy of K, in B. Call such a pair of copies of K, a fused K, pair. A fused K, pair involves 7 vertices 3 on the left, 4 on the right) and 8 edges. Arguing as above, the expected number of sets of b vertex-disjoint) fused K, pairs involving 8b edges) is, using Lemma.1, at most ) 1 r 1) 4 b e ) ) 4 r 4 b 4 = O b! 8 + Or + kmax)) 4 8 b 4 = O e/8) b) = O1/),.9) by choice of b. It follows that the expected number of edge-disjoint copies of K, in B is at most Q 1 + Q with probability O1/). Since r 1) r 1)4 k 3 max 3 r 1), 9
10 we have Q 1 + Q 3Q 1 = N. Hence v) holds with the required probability. Recalling.3).7), we conclude that B r + k) / B r 0) k) = 1 + O r 5 kmax/), 4 and the result follows using.1). As a by-product, we obtain a new asymptotic enumeration formula for sparse simple uniform hypergraphs with given degrees. The result below allows r to grow slowly with n, whereas [, Theorem 1.1] restated earlier as Theorem 1., for ease of comparison) only considered fixed r 3. However for 7 r = O1), the result of [] has wider applicability and a better error bound, as it assumes only k max = o) and achieves error bound Ok max/). For r {3, 4, 5, 6}, Corollary.3 precisely matches [, Theorem 1.1].) Corollary.3. For n 3, let r = rn) 3 be an integer and let k = kn) = k 1,..., k n ) be a vector of nonnegative integers, where each k j = k j n) may depend on n. Let = n) = n j=1 k j for all n 3, and suppose that the set I = {n 3 rn) divides n)} is infinite. If and r 4 kmax 3 = o) as n tends to infinity along elements of I, then! H r k) = /r)! r!) /r n i=1 k exp r 1) ) i! + Or4 kmax/) 3. Proof. Since r 3, it follows from.3) that B r k) / B r 0) k) = 1 + Or 4 kmax/), 3 and as noted earlier,.3) holds when r 4 k 3 max = o). Combining this with.1) and.) completes the proof. 3 Double links For nonnegative integers d, let C d be the set of bipartite graphs in B + r k) with exactly d edge-disjoint copies of K,. The corresponding hypergraph has exactly d double links.) The sets C d partition B + r k), and so B + r k) = N We estimate this sum using a switching operation which we now define. d=0 C d. 3.1) Given B C d, a d-switching is described by an 8-tuple u 1, u, w 1, w, f 1, f, g 1, g ) of vertices of B with u 1, u, w 1, w {v 1,..., v n } and f 1, f, g 1, g {e 1,..., e /r }, such that 10
11 B has a copy of K, on {u 1, u } {f 1, f }, w 1 g 1 and w g are edges in B. The corresponding d-switching produces a new bipartite graph B with the same vertex set as B and with edge set EB ) = EB) \ {u 1 f 1, u 1 f, w 1 g 1, w g }) {u 1 g 1, u 1 g, w 1 f 1, w f }. 3.) The d-switching operation is illustrated in Figure below. Note that in the hypergraph setting, the d-switching replaces the four edges f 1, f, g 1, g of the original hypergraph with the edges f 1, f, g 1, g defined by f j = f j \ {u 1 }) {w j }, g j = g j \ {w j }) {u 1 } for j = 1,.) w 1 g 1 w 1 g 1 u 1 f 1 u 1 f 1 u f u f w g w g Figure : A d-switching Let dist G x, y) denote the length of the shortest path from x to y in a graph G. The bipartite graph B produced by the d-switching belongs to C d 1 if the following conditions hold in B: I) Neither of g 1 or g belong to a copy of K,. II) For j = 1, we have dist B u 1, g j ) 5 and dist B w j, f j ) 5. Hence in particular, all vertices in the 8-tuple are distinct.) If I) fails then the d-switching may destroy more than one copy of K,, while if II) fails then the d-switching may create a new copy of K,, or may result in a double edge.) 11
12 A reverse d-switching is the reverse of a d-switching. A reverse d-switching from a bipartite graph B C d 1 is described by an 8-tuple of vertices u 1, u, w 1, w, f 1, f, g 1, g ) with u 1, u, w 1, w {v 1,..., v n } and f 1, f, g 1, g {e 1,..., e /r } such that u 1 g 1, u 1 g, w 1 f 1, u f 1, u f, w f are all edges of B. The reverse d-switching produces the bipartite graph B defined by 3.). This operation is depicted in Figure by following the arrow in reverse. The bipartite graph B produced by the reverse d-switching belongs to C d if the following conditions hold in B : I ) None of f 1, f, g 1, g belong to a copy of K,. II ) For j = 1, we have dist B u 1, f j ) 5 and dist B w j, g j ) 5. Hence in particular, all vertices in the 8-tuple are distinct.) We will analyse d-switchings to obtain an asymptotic expression for C d / C d 1, and then combine these to find an expression for L r k) = C 0 //r)!, which is the quantity of interest. The following summation lemma from [8] will be needed. The statement has been adapted slightly from that given in [8], without affecting the proof given there.) Lemma 3.1 [8, Corollary 4.5]). Let N be an integer and, for 1 i N, let real numbers Ai), Ci) be given such that Ai) 0 and Ai) i 1)Ci) 0. Define A 1 = min N i=1 Ai), A = max N i=1 Ai), C 1 = min N i=1 Ci) and C = max N i=1 Ci). Suppose that there exists a real number ĉ with 0 < ĉ < 1 such that max{a/n, C } ĉ for all A [A 3 1, A ], C [C 1, C ]. Define n 0,..., n N by n 0 = 1 and n i = 1 i Ai) i 1)Ci)) n i 1 for 1 i N. Then where Σ 1 N n i Σ, i=0 Σ 1 = exp A 1 1 A 1C ) eĉ) N, Σ = exp A 1 A C A C 1) + eĉ) N. First we analyse one d-switching. 1
13 Lemma 3.. Suppose that d is an integer such that 1 d N. Then C d = C d 1 r )) 1) kmax d + r k 1 + O max). 4d Proof. Suppose that B C d. There are d ways to choose a copy of K,, and four ways to order the two vertices u 1, u ) on the left and the two vertices f 1, f ) on the right. Then there are 4d) ways to select distinct edges w 1 g 1, w g, avoiding edges which lie in a copy of K,. Hence there are at most 8-tuples giving a d-switching in B. 4d 4d) = 4d 1 + Od/) ) However, some of these 4-tuples are illegal and must be removed. All tuples counted above satisfy condition I). There are Odr+k max )) 8-tuples in which two of the vertices coincide, and Odrk max ) 8-tuples in which all eight vertices are distinct but an edge exists in B from u 1 to g j or from w j to f j, for some j {1, }. There are Odr k max) 8-tuples for which dist B u 1, g j ) = 3 or dist B w j, f j ) = 3, for some j {1, }. For example, given a copy of K, on {u 1, u } {f 1, f }, there are Or k max ) choices for w 1 within distance three of f 1, and then Ok max ) choices for a neighbour g 1 of w 1.) Hence condition II) fails for Odr k max) 8-tuples, and number of d-switchings which can be applied to B is )) d + r 4d 1 kmax + O. Next, given B C d 1, there are ) ways to select u 1, g 1, g ) and u, f 1, f ) such that u 1 g 1, u 1 g, u f 1 and u f are all edges of B. Then there are r 1) ways to choose w 1, w ) such that w j f j is an edge of B and w j u, for j = 1,. Some of these choices are illegal: condition I ) fails for Odr k max ) 8-tuples, while in Or k max r + k max ) ), two of the vertices coincide. In Or 3 k max ) there is an edge from w j to g j or an edge from u 1 to f j, for some j {1, }, and the number of 8-tuples with dist B u 1, f j ) = 3 or with dist B w j, g j ) = 3 for some j {1, } is Or 4 k 3 max ). Hence condition II ) fails for Or 4 k 3 max ) 8-tuples, and the number of reverse d-switchings which can be applied to B is r 1) 1 + O kmax d + r k max) )). Taking the ratio completes the proof: the error term from the reverse d-switchings dominates since 1/ k max /. 13
14 We can now prove our main result. The proof is similar to those in related enumeration results such as [7]. We present the proof in full in order to demonstrate how the factors of r arise in the error bounds since previous results only dealt with r =, or assumed that r was constant). Proof of Theorem 1.1. First we prove that N d=0 r 1) C d = C 0 exp 4 + O )) r 4 kmax ) Let d be the first value of d N for which C d =, or d = N + 1 if no such value of d exists. We saw in Lemma 3. that any B C d can be converted to some B C d 1 using a d-switching. Hence C d = for d d N. In particular, 3.3) holds if C 0 =, so we assume that d 1. By Lemma 3., there is some uniformly bounded function α d such that for 1 d N, where C d C 0 = 1 C d 1 d C 0 Ad) d 1)Cd)) 3.4) Ad) = r 1) α d r 4 kmax 3, Cd) = α d r k max 4 4 for 1 d < d, and Ad) = Cd) = 0 for d d N. We wish to apply Lemma 3.1. It is clear that Ad) d 1)Cd) 0, from 3.4) if 1 d < d or by definition, if d d N. If α d 0 then Ad) Ad) d 1)Cd) 0 by 3.4), while if α d < 0 then Ad) is nonnegative by definition. Now define A 1, A, C 1, C by taking the minimum and maximum of Ad) and Cd) over 1 d N. Let A [A 1, A ] and C [C 1, C ] and set ĉ = 1 0. Since A = r 1) /4 + o1) and C = o1), we have that max{a/n, C } ĉ for sufficiently large, by the definition of N. Hence Lemma 3.1 applies and gives an upper bound N d=0 C d r 1) C 0 exp 4 + O Since e/10) N e/10) 3 log 1, this gives N d=0 C d r 1) C 0 exp 4 )) r 4 kmax 4 + O e/10) ) N. + O )) r 4 kmax 4. 14
15 In the case that d = N + 1, the lower bound given by Lemma 3.1 is the same within the stated error term, which establishes 3.3) in this case. This leaves the case that 1 d N. Considering the analysis of the reverse switchings from Lemma 3., this case can only arise if But then = Od k max + r k 3 max) = O k max r k max + log ) ). r 1) 4 ) r k = O maxr kmax + log ) = O ) r 4 kmax 4, so the trivial lower bound of 1 matches the upper bound within the error term. Hence 3.3) also holds when 1 d N. Therefore 3.3) holds in both cases. Applying Theorem. and 3.1) gives L r k) = C 0 /r)! = B+ r k) /r)! = completing the proof. exp r 1) 4! /r)! r!) /r n j=1 k j! exp )) r 4 kmax 4 + O r 1) r 1) 4 + O )) r 5 kmax 4, Acknowledgement We are very grateful to Brendan ckay [13] for suggesting that use of the incidence matrix of the hypergraph would simplify the calculations. References [1] C. Berge, Hypergraphs: Combinatorics of Finite Sets, Elsevier, Amsterdam, [] V. Blinovsky and C. Greenhill, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, Preprint 013). arxiv: [3] C. Cooper, A. Frieze,. olloy and B. Reed, Perfect matchings in random r-regular, s-uniform hypergraphs, Combinatorics, Probability and Computing ),
16 [4] A. Dudek, A. Frieze, A. Ruciński and. Šileikis, Approximate counting of regular hypergraphs, Information Processing Letters ), [5] E. Estrada, J.A. Rodríguez-Velázquez, Subgraph centrality and clustering in complex hyper-networks, Physica A: Statistical echanics and its Applications ), [6] G. Ghoshal, V. Zlatić, G. Caldarelli and.e.j. Newman, Random hypergraphs and their applications, Physical Review E ), [7] C. Greenhill and B.D. ckay, Asymptotic enumeration of sparse multigraphs with given degrees, SIA Journal on Discrete athematics 7 013), [8] C. Greenhill, B.D. ckay and X. Wang, Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums, Journal of Combinatorial Theory Series A) ), [9] S. Klamt, U.-U. Haus and F. Theis, Hypergraphs and cellular networks, PLoS Comput. Biol ) e [10] G. Kuperberg, S. Lovett and R. Peled, Probabilistic existence of regular combinatorial structures, Preprint, 013. arxiv: [11] B.D. ckay, Subgraphs of random graphs with specified degrees, Congressum Numerantium ), [1] B. D. ckay, Subgraphs of dense random graphs with specified degrees, Combin. Probab. Comput., 0 011) [13] B. D. ckay, Personal communication, 014. [14] B. D. ckay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree, European J. Combin., ) [15] B.D. ckay and N.C. Wormald, Asymptotic enumeration by degree sequence of graphs with degrees on 1/ ), Combinatorica ),
Asymptotic 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 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 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 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 informationThe generalised acyclic edge chromatic number of random regular graphs
The generalised acyclic edge chromatic number of random regular graphs Stefanie Gerke Institute of Theoretical Computer Science ETH Zentrum, IFW E48.3 Haldeneggsteig 4, Zurich CH - 8092 Switzerland sgerke@inf.ethz.ch
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 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 informationGenerating p-extremal graphs
Generating p-extremal graphs Derrick Stolee Department of Mathematics Department of Computer Science University of Nebraska Lincoln s-dstolee1@math.unl.edu August 2, 2011 Abstract Let f(n, p be the maximum
More informationAssignment 2 : Probabilistic Methods
Assignment 2 : Probabilistic Methods jverstra@math Question 1. Let d N, c R +, and let G n be an n-vertex d-regular graph. Suppose that vertices of G n are selected independently with probability p, where
More informationInterval minors of complete bipartite graphs
Interval minors of complete bipartite graphs Bojan Mohar Department of Mathematics Simon Fraser University Burnaby, BC, Canada mohar@sfu.ca Arash Rafiey Department of Mathematics Simon Fraser University
More 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 informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
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 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 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 informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
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 informationOn the ascending subgraph decomposition problem for bipartite graphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 46 (2014) 19 26 www.elsevier.com/locate/endm On the ascending subgraph decomposition problem for bipartite graphs J. M.
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
More informationCorrigendum: The complexity of counting graph homomorphisms
Corrigendum: The complexity of counting graph homomorphisms Martin Dyer School of Computing University of Leeds Leeds, U.K. LS2 9JT dyer@comp.leeds.ac.uk Catherine Greenhill School of Mathematics The University
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 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 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 informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
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 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 informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
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 informationExpansion properties of a random regular graph after random vertex deletions
Expansion properties of a random regular graph after random vertex deletions Catherine Greenhill School of Mathematics and Statistics The University of New South Wales Sydney NSW 05, Australia csg@unsw.edu.au
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 informationA prolific construction of strongly regular graphs with the n-e.c. property
A prolific construction of strongly regular graphs with the n-e.c. property Peter J. Cameron and Dudley Stark School of Mathematical Sciences Queen Mary, University of London London E1 4NS, U.K. Abstract
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 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 informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
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 informationClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.
Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part II. Nontrivial strip-structures Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia
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 informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationSubgraphs of random graphs with specified degrees
Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Subgraphs of random graphs with specified degrees Brendan D. McKay Abstract. If a graph is chosen uniformly at random
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 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 informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationApplications of the Sparse Regularity Lemma
Applications of the Sparse Regularity Lemma Y. Kohayakawa (Emory and São Paulo) Extremal Combinatorics II DIMACS 2004 1 Szemerédi s regularity lemma 1. Works very well for large, dense graphs: n-vertex
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More 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 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 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 informationPacking and Covering Dense Graphs
Packing and Covering Dense Graphs Noga Alon Yair Caro Raphael Yuster Abstract Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere
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 informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationRegular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Peter Hamburger Department of Mathematical
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationSome hard families of parameterised counting problems
Some hard families of parameterised counting problems Mark Jerrum and Kitty Meeks School of Mathematical Sciences, Queen Mary University of London {m.jerrum,k.meeks}@qmul.ac.uk September 2014 Abstract
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 informationThe complexity of counting graph homomorphisms
The complexity of counting graph homomorphisms Martin Dyer and Catherine Greenhill Abstract The problem of counting homomorphisms from a general graph G to a fixed graph H is a natural generalisation of
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 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 informationFirst Order Convergence and Roots
Article First Order Convergence and Roots Christofides, Demetres and Kral, Daniel Available at http://clok.uclan.ac.uk/17855/ Christofides, Demetres and Kral, Daniel (2016) First Order Convergence and
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
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 informationForcing unbalanced complete bipartite minors
Forcing unbalanced complete bipartite minors Daniela Kühn Deryk Osthus Abstract Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of
More 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 informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationarxiv: v3 [math.co] 31 Jan 2017
How to determine if a random graph with a fixed degree sequence has a giant component Felix Joos Guillem Perarnau Dieter Rautenbach Bruce Reed arxiv:1601.03714v3 [math.co] 31 Jan 017 February 1, 017 Abstract
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More 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 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 informationLower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 7, no. 6, pp. 67 688 (03 DOI: 0.755/jgaa.003 Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
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 informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationAdditive Combinatorics and Szemerédi s Regularity Lemma
Additive Combinatorics and Szemerédi s Regularity Lemma Vijay Keswani Anurag Sahay 20th April, 2015 Supervised by : Dr. Rajat Mittal 1 Contents 1 Introduction 3 2 Sum-set Estimates 4 2.1 Size of sumset
More 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 informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationarxiv: v1 [math.co] 11 Jul 2016
Characterization and recognition of proper tagged probe interval graphs Sourav Chakraborty, Shamik Ghosh, Sanchita Paul and Malay Sen arxiv:1607.02922v1 [math.co] 11 Jul 2016 October 29, 2018 Abstract
More informationarxiv: v3 [cs.dm] 18 Oct 2017
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes arxiv:1707.02473v3 [cs.dm] 18 Oct 2017 Fábio Protti and Uéverton dos Santos Souza Institute of Computing - Universidade
More informationCombinatorial Rigidity and the Molecular Conjecture
Page 1 of 65 Combinatorial Rigidity and the Molecular Conjecture Brigitte Servatius Worcester Polytechnic Institute The Proof of the Product Rule To derivate a product as defined The diff rence quotient
More informationLinear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs Nathan Lindzey, Ross M. McConnell Colorado State University, Fort Collins CO 80521, USA Abstract. Tucker characterized
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationarxiv: v1 [math.co] 5 May 2016
Uniform hypergraphs and dominating sets of graphs arxiv:60.078v [math.co] May 06 Jaume Martí-Farré Mercè Mora José Luis Ruiz Departament de Matemàtiques Universitat Politècnica de Catalunya Spain {jaume.marti,merce.mora,jose.luis.ruiz}@upc.edu
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 informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationLong cycles have the edge-erdős-pósa property
Long cycles have the edge-erdős-pósa property Henning Bruhn, Matthias Heinlein and Felix Joos Abstract We prove that the set of long cycles has the edge-erdős-pósa property: for every fixed integer l 3
More informationThe 3-colored Ramsey number of odd cycles
Electronic Notes in Discrete Mathematics 19 (2005) 397 402 www.elsevier.com/locate/endm The 3-colored Ramsey number of odd cycles Yoshiharu Kohayakawa a,1,4 a Instituto de Matemática e Estatística, Universidade
More informationA tight Erdős-Pósa function for long cycles
A tight Erdős-Pósa function for long cycles F. Mousset, A. Noever, N. Škorić, and F. Weissenberger June 10, 2016 Abstract A classic result of Erdős and Pósa states that any graph either contains k vertexdisjoint
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 informationON THE STRUCTURE OF ORIENTED GRAPHS AND DIGRAPHS WITH FORBIDDEN TOURNAMENTS OR CYCLES
ON THE STRUCTURE OF ORIENTED GRAPHS AND DIGRAPHS WITH FORBIDDEN TOURNAMENTS OR CYCLES DANIELA KÜHN, DERYK OSTHUS, TIMOTHY TOWNSEND, YI ZHAO Abstract. Motivated by his work on the classification of countable
More informationCitation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).
Syddansk Universitet Transversals in 4-uniform hypergraphs Henning, Michael A; Yeo, Anders Published in: Journal of Combinatorics Publication date: 2016 Document version Forlagets udgivne version Document
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More information