List coloring hypergraphs
|
|
- Hilary Williamson
- 5 years ago
- Views:
Transcription
1 List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada Department of Mathematics University of California San Diego, CA Submitted: Apr 29, 2010; Accepted: Sep 6, 2010; Published: Sep 22, 2010 Mathematics Subject Classification: 05C15, 05C65 Abstract Let H be a hypergraph and let L v : v V H) be sets; we refer to these sets as lists and their elements as colors. A list coloring of H is an assignment of a color from L v to each v V H) in such a way that every edge of H contains a pair of vertices of different colors. The hypergraph H is k-list-colorable if it has a list coloring from any collection of lists of size k. The list chromatic number of H is the minimum k such that H is k-list-colorable. In this paper we prove that every d-regular three-uniform linear hypergraph has list chromatic number at least log d 5log log d )1/2 provided d is large enough. On the other hand there exist d-regular three-uniform linear hypergraphs with list chromatic number at most log 3 d + 3. This leaves the question open as to the existence of such hypergraphs with list chromatic number olog d) as d. 1 Introduction A hypergraph H is k-uniform if every edge of H has size k, and d-regular if every vertex of H is in exactly d edges of H. A hypergraph is linear if any pair of distinct edges of the hypergraph intersect in at most one vertex. Let H be a hypergraph and let L v : v V H) be sets; we refer to these sets as lists. A list coloring of H is an assignment of an element of L v to each v V H) in such a way that every edge of H contains a pair of vertices assigned different elements. The hypergraph H is called k-list-colorable if it has a list coloring from any collection of lists of size k. The list chromatic number χ l H) of H, also called the choice number of H, is the minimum k such that H is k-list-colorable. In this paper, we study the list chromatic number of linear uniform regular hypergraphs. Partially supported by NSERC Research supported by an Alfred P. Sloan Research Fellowship and NSF Grant DMS the electronic journal of combinatorics ), #R129 1
2 1.1 List coloring graphs The notion of list-coloring is a generalization of the notion of proper coloring, and has been studied extensively for graphs. In particular, Alon [1] showed that every bipartite graph of minimum degree at least d has list chromatic number at least 1 log 2 2 d, improving log d log log d a preceding lower bound of order as d in [2]. On the other hand it is known [9] that the complete bipartite graph K d,d with d vertices in each part satisfies χk d,d ) = 1 + o1)) log 2 d. It has been asked whether every bipartite graph with maximum degree d has list chromatic number Olog d) see Alon and Krivelevich [4]) but this tantalizing problem remains open. Here and in what follows, the logarithm is taken to be the natural logarithm unless a base is explicitly displayed. 1.2 List coloring hypergraphs There seem to be very few results on list colorings of hypergraphs. Perhaps the most famous question on colorings of hypergraphs is the Erdős-Faber-Lovász conjecture see [6]): given an n-uniform linear hypergraph consisting of n edges, there is vertex-coloring of the hypergraph for which every edge receives all n colors. Equivalently, the conjecture states that any graph comprising the union of n edge-disjoint cliques of size n has chromatic number n. Via a more general result on coloring linear hypergraphs, Kahn [11] showed that that an n-uniform linear hypergraph can be vertex-colored with n + on) colors in such a way that the vertices in each edge all receive different colors. Recently, a simple proof of the Erdős-Faber-Lovász conjecture was announced. For Steiner triple systems with n vertices three-uniform hypergraphs in which every pair of vertices is covered exactly once a lower bound of order log n/ log log n for the list chromatic number was shown in [10]. In this paper, we concentrate on giving bounds on the list chromatic number of all linear regular three-uniform hypergraphs, which we refer to as triple systems. We shall check in this paper that the complete r-partite r-uniform hypergraph K r n with parts of size n has list chromatic number asymptotic to log r n as n. 1.3 Main Theorem The main result of this paper shows that every d-regular linear triple system has large list chromatic number: Theorem 1 There exists a constant d 0 such that for d d 0, every d-regular linear triple system H has log d ) 1/2. χ l H) > 5 log log d On the other hand, there exists a d-regular linear triple system with list chromatic number at most log 3 d + 3. The requirement of linearity in this theorem is necessary. Consider the triple system consisting of vertex set V = V 1 V n W with V i = 2 and W = n and where the electronic journal of combinatorics ), #R129 2
3 the edge set E consists of {e V : e W = 1, i : V i e}. This is an n-regular triple system whose list chromatic number is two, since for any assignment of lists we can choose different colors for the two vertices inside each V i. Relative to the theorem above, the most relevant open question is the existence of d-regular linear triple systems with list chromatic number olog d) as d. We leave this as an open problem. Problem. Do there exist three-uniform d-regular linear hypergraphs of list chromatic number olog d) as d? 2 List coloring complete r-partite hypergraphs In this section, we show that for infinitely many d, there exists a linear d-regular triple system with list chromatic number at most log 3 d+3. The example is the following threepartite triple system K 3 d L): if L is any d d latin square, then we create a linear triple system with three parts as follows. We index the rows of L by a set R of size d, the columns by a set C of size d, and then let R, C, [d] denote the parts of K 3 d L). Then the edges of K 3 d L) are all triples {r, c, i} with r R, c C, and such that i is in position r, c) in L. Note that by definition of a latin square there are no repeated entries in any row or column of L, so the triple system K 3 d L) is d-regular and linear. We will show that it has list chromatic number at most log 3 d + 3 by showing that the complete r-partite hypergraph K r d which contains K 3 d L) when r = 3 has list chromatic number at most log r d + 3. We will also show that K r d has list chromatic number at least log r d Olog log d) as d. Our argument is based on that of [9]. We define a hypergraph H to be r-colorable if the list assignment in which all lists are {1,...,r} admits a list coloring of H. The following lemma will be used: Lemma 2 Let m r k) denote the minimum number of edges in a k-uniform hypergraph which is not r-colorable. Then as k, r k 1 m r k) O r k 2 r k ). Proof A random r-coloring of a hypergraph consists in choosing uniformly at random a color from [r] independently for each vertex in the hypergraph. The lower bound of r k 1 in the lemma follows from the fact that in a random r-coloring of a k-uniform hypergraph with m edges, the expected number of edges whose vertices are all assigned the same color is r 1 k m, so if m < r k 1, then the hypergraph is r-colorable. In fact, this is all we shall need to prove χ l K r n ) log r n + 3. The upper bound on m r k) also follows from probabilistic methods; we sketch the proof for r > 2, since it is very similar to the proof for r = 2 given in [7] see also Alon and Spencer [5], Page 9). We consider a hypergraph H with vertex set [rk 2 ] constructed by randomly and uniformly selecting sets of size k in T independent rounds from [rk 2 ]. We shall take T = 2k 2 er) k log r. the electronic journal of combinatorics ), #R129 3
4 An r-coloring of H is a partition X 1, X 2,...,X r ) of the vertex set [rk 2 ] of H. An edge of H is monochromatic if it lies entirely in some X i. We say that an r-coloring of H fails in round i if in the ith round, the chosen set of size k is monochromatic. The aim is to show that the expected number of r-colorings which do not fail in any round is less than one, and we follow the computation of Erdős [7]. The probability that the edge chosen at round i is monochromatic for a given coloring X 1, X 2,...,X r ) is exactly ) rk 2 1 r ) Xi. k k i=1 By convexity of binomial coefficients, the sum is a minimum when X 1 = X 2 = = X r = k 2 : r ) ) Xi k 2 r. k k i=1 Using the standard bounds ) rk 2 k erk) k and ) k 2 k k k, the probability that an edge chosen at round i is monochromatic is at least r/er) k. It follows that the probability that a given coloring X 1, X 2,...,X r ) does not fail at any round is at most 1 r ) T er) k since the rounds are independent. Now T was chosen so that this quantity is less than r rk2. Since the number of r-colorings of [rk 2 ] is r rk2, we conclude that the expected number of r-colorings which do not fail at any round is less than one. In particular, there is a witness H to this event. This hypergraph H has exactly T edges and is not r-colorable, as required. We use the bounds on m r k) in the above lemma to give bounds on χ l K r m ) as follows: Theorem 3 For all r 2 and as m, χ l K r m ) = 1 + o1)) log r m. Proof If we can show χ l K r m ) k when rm = m r k) 1 and χ l K r m ) k + 1 when m = m r k), then we are done using the bounds in the last lemma, since rm+1 r k 1 implies k log r m + 3 and m Ck 2 r k implies k log r m 2 log r log r m O1) when m, as required. First we show that for m = m r k), we have χ l K r m ) > k. By definition of m r k) = m, there is a k-uniform hypergraph F with m edges such that F is not r-colorable. We let the lists in the ith part V i of K r m be exactly the edges of F, for 1 i r. We claim there is no coloring of K r m from this list assignment. Suppose, for a contradiction, that there is a list coloring of K r m from these lists, and let S 1, S 2,..., S r be the sets of colors used on the vertices of V 1, V 2,...,V r, respectively. Note that each S i is actually a set of vertices of F. We observe that r S i = i=1 the electronic journal of combinatorics ), #R129 4
5 otherwise a certain color appears on a vertex v i V i for 1 i r, in which case {v 1, v 2,...,v r } is a monochromatic edge of K r m. Since each S i is a transversal of the edges in F, T i = V F)\S i does not contain any edges of F for 1 i r. Since S i =, every vertex of F is in the complement of some S i and therefore T 1 T r = V F). This contradicts that F is not r-colorable, and hence χ l K r,m ) > k when m = m r k). Conversely we show χ l K r m ) k when rm = m r k) 1. Consider an assignment of lists of size k to the rm vertices of K r m, and let F be the k-uniform hypergraph of all those lists. Then F has an r-coloring since F < m r k). Fix an r-coloring of F, say V F) = T 1 T 2 T r. The list L v at a vertex v V i must contain an element not in T i, otherwise L v would be monochromatic under the coloring T 1 T 2 T r of F. To each v V i we assign an arbitrary element of L v \T i, for 1 i r. We claim this is a proper coloring of K r m. If not, then there is an edge {v 1, v 2,...,v r } in K r m where v i V i, and such that every v i : 1 i r receives the same color, which is an element of T j for some j [r]. However, v j was assigned an element of L vj \T j, which is a contradiction. Therefore χ l K r m ) k. This completes the proof. It appears to be an interesting question to determine fd) = min L χ l K 3 d L)) where the minimum is over all d d latin squares. In particular, it would be interesting to determine whether fd) = olog d) as d. 3 Lemmas The probabilistic lemmas we use to prove Theorem 1 are given here. The first lemma is the Chernoff bound, one of the basic tools in probabilistic methods see for example Alon and Spencer [5]. Lemma 4 Let Z 1, Z 2,...,Z n be identically distributed independent random variables where PZ i = 1) = p and PZ i = 0) = 1 p, and let S be their sum. Then for any ǫ 0, 1], P S ES) > ǫes)) 2 exp ǫ 2 ES)/2). We also require the Lovász Local Lemma [8] in the following form. Here and in what follows, A c denotes the complement of an event A. Lemma 5 Let A 1, A 2,...,A n be events in a probability space, such that each A i is mutually independent of any subset of events indexed by the set [n]\j i for some dependency set J i [n] where max J i =. Suppose that for all i [n]. Then n P i=1 PA i ) 1 4 A c i) exp n ). the electronic journal of combinatorics ), #R129 5
6 4 Proof of Theorem 1 We are given a d-regular linear triple system H, and we want to come up with a collection of lists on the vertices from which no coloring is possible and where the lists are as large as possible. The idea of the proof is to show that if we assign random lists of length s in [t] := {1, 2,..., t} to the vertices of H, for some carefully chosen values of s and t, then with positive probability there is no proper coloring of H from these lists. We will choose s = log d) 1/2 5 log log d) 1/2 and t = 8s) ss+4) and put p := 1/8s) 3 t. If d is a large enough constant, then it is straightforward to check that the parameters p, s, t satisfy for completeness a verification is written in the appendix): t exp s 2 p 3 d/4t 2 ) < 1/64d 2 1) exp n/8s) 2 t) < s 3pn 2) exp p 2 n/8) < exp n/d 2 ). 3) For any K 8s) s, we record that standard bounds on binomial coefficients see Appendix : Lemma 6) give ) ) t/k t > 2K) s. 4) s s 4.1 Preprocessing Define random sets X V H) and Y V H) by independently placing each vertex of V H) into X with probability p 2 and into Y with probability p and into Z = V H)\X Y ) with probability 1 p p 2. Let H denote the three-partite hypergraph consisting of all {x, y, z} H such that x X, y Y and z Z. We write dx, y) > 2 to denote that in H every edge on x is disjoint from every edge on y in other words x and y are at distance more than two. For y Y let Γ X y) = {x X : {x, y, z} H for some z} and for z Z let Γ XY z) = {x, y) X Y : {x, y, z} H }. Define d X y) = Γ X y) and d XY z) = Γ XY z). Since H is a d-regular linear hypergraph, we have for y Y and z Z, Ed X y)) = 2p 2 1 p p 2 )d and Ed XY z)) = 2p 3 d. Let A y : y Y be the events p 2 d < d X y) < 4p 2 d and let A z : z Z be the event p 3 d < d XY z) < 4p 3 d. Claim 1. With positive probability, each event A X = { 1 2 p2 n < X < 2p 2 n} and A Y = { 1 2 pn < Y < 2pn} and every A y : y Y and every A z : z Z occurs. Proof. We shall apply the Chernoff Bound with ǫ = 1/ 8. The event A y contains the event d X y) Ed X y)) < ǫed X y)), since p < 1/8 3, and clearly A z contains the event the electronic journal of combinatorics ), #R129 6
7 d XY z) Ed XY z)) < ǫed XY z)). Since vertices are placed independently in the sets X and Y, Lemma 4 shows PA c y) 2 exp p2 d ) 8 and PA c z) 2 exp p3 d ) 8 and similarly PA c X ) 2 exp p2 n/8) and PA c y ) 2 exp pn/8). A dependency graph of the events A y : y Y and A z : z Z has maximum degree at most = 4d 2, since any single event A c v is mutually independent of any set of events Ac w : dv, w) > 2. By 1), both the bounds in 5) are easily less than 1/4. By Lemma 5, with probability at least exp n/4d 2 ) every A y : y Y and every A z : z Z occurs. By 3), exp n/4d 2 ) > PA c X Ac Y ), and so with positive probability, the events A X and A Y and every A y : y Y and A z : z Z occurs. This proves the claim. For the remainder of the proof, we work in a subhypergraph H for which all the events in Claim 1 hold, and we assume that X, Y and Z are the parts of H. 4.2 Choice of lists in X First we assign lists to X. We choose uniformly and independently random lists of size s from [t] for the vertices of X. For y Y, let B y be the event that no color appears in more than 2sd X y)/t lists in Γ X y) and for z Z let B z be the event that no color appears in more than 2sd XY z)/t lists in Γ X z) := {x X : y Y, x, y) Γ XY z)}. 5) Claim 2. With positive probability, every B y : y Y and every B z : z Z occurs. Proof. Since H is linear, note that Γ X z) = d XY z). The expected number of times a particular color appears in lists in Γ X y) is exactly sd X y)/t and the expected number of times a particular color appears in Γ X z) is sd XY z)/t. Since the lists are chosen independently, the probability that a particular color appears in more than 2sd X y)/t lists in Γ X y) is at most 2 exp sd X y)/2t), by the Chernoff Bound with ǫ = 1. A similar statement holds for the colors in Γ X z), and since there are at most t colors, we deduce from the union bound that PB c y ) < 2t exp sd Xy)/2t) < 2t exp sp 2 d/2t) PB c z ) < 2t exp sd XY z)/2t) < 2t exp sp 3 d/2t). A dependency graph of the events Bv c has maximum degree at most = 4d2, since Bv c is mutually independent of any events Bw c : dv, w) > 2. By 1), we easily have PBy c) < 1/4 and PBc z ) < 1/4, and so Lemma 5 completes the proof of Claim 2. From now on we fix an assignment of lists L of size s from [t] to the vertices of X, such that every B y : y Y and every B z : z Z occurs. Let ρ y be the number of colors the electronic journal of combinatorics ), #R129 7
8 used at least d X y)/2t times on Γ X y). Since B y occurs, t ρ y ) d Xy) 2t + ρ y 2sd X y) t d X y) and it follows that ρ y > t/4s. Since every B y occurs, we have that for each y Y and each coloring of X from L there exists a set S y of t/4s colors each appearing at least p 2 d/2t times in Γ X y). 4.3 Choice of lists in Y Now we independently and randomly assign lists L y of size s from [t] to the y Y. For a fixed coloring of X from L, if L y S y, then any color selected from L y results in at least p 2 d/2t vertices x Γ X y) of the same color as y. Let B χ be the event that under a coloring χ of X, L y S y for at least 1 2 8s) s Y vertices y Y, and let B = χ B χ where the intersection is over all colorings of X from L. For z Z, let C z be the event that no color appears on the list at x and at y for at least 4s 2 d XY z)/t 2 pairs x, y) Γ XY z). Claim 3. With positive probability, B as well as every C z : z Z occurs. Proof. We observe that for every χ and every y, ) ) t/4s t PL y S y ) / > 8s) s s s using 4) with K = 4s. Therefore the expected number of events L y S y is at least 8s) s Y. Since the L y are chosen independently, the Chernoff Bound with ǫ = 1/2 shows that for a fixed coloring χ of X, PBχ c ) < 2 exp Y ). 88s) s Since there are at most s X colorings of X, and since by Claim 1 Y pn/2 and X 2p 2 n, the expected number of colorings χ of X for which Bχ c occurs is at most 2 exp Y ) s X < 2 exp pn ) 88s) s 168s) + s 2p2 n log s < exp pn ). 208s) s By 2), with room to spare, this is less than exp n/d 2 ), and so Markov s Inequality gives PB c ) < exp n/2d 2 ). For x Γ X z), there is a unique y Γ Y z) such that x, y) Γ XY z), since H is linear. The chance that y is assigned a list containing a particular color in L x is exactly s/t. Fix a color i, and let C i z be the event that color i appears on the list at x and at y for at least 4s 2 d XY z)/t 2 pairs x, y) Γ XY z). Recall that since every B z occurs, color i appears at most 2sd XY z)/t times in Γ X z). The expected number of x, y) Γ XY z) such that i L x L y is at most 2s 2 d XY z)/t 2. Since lists are assigned independently, we may apply the Chernoff Bound with ǫ = 1 to obtain PC i z ) < 2 exp s2 d XY z)/t 2 ). the electronic journal of combinatorics ), #R129 8
9 Since there are t colors in total, the union bound shows By Claim 1, this is at most PC c z ) < 2t exp s2 d XY z)/t 2 ). t exp s 2 p 3 d/2t 2 ). Now Cz c is mutually independent of any events Cc w : dw, z) > 2, so a dependency graph of events Cz c has maximum degree at most = 4d 2. By 1), PCz) c < 1/4 and so Lemma 5 shows that with probability at least exp n/4d 2 ), every C z occurs. Using the preceding bound on PB c ), we see that with positive probability every C z : z Z and B occurs. Let us now extend our list assignment L to include a list assignment of s elements from [t] to each y Y, such that B and each C z : z Z occurs. 4.4 Choice of lists for Z We have assigned lists L to the vertices of X and Y in such a way that in every coloring of X, there is a set S Y of size at least pn/48s) s with the property that for y S, L y S y this is the event B), and for every z Z, every color appears on the list at x and at y for at most 4s 2 d XY z)/t 2 pairs x, y) Γ XY z) these are the events C z ). Now we show that there exists an assignment of lists to Z from which no coloring of H is possible. Let G denote the bipartite graph consisting of parts X and Y and edges z Z Γ XY z). If κ is any fixed coloring of X Y, then since B occurs, whichever color from L y that is assigned to y by κ results in at least p 2 d/2t pairs x, y) G such that x and y have the same color. Therefore we have at least p 2 d 2t > p3 dn 8t8s) s y S pairs x, y) G such that x and y are assigned the same color by κ. We call these monochromatic edges of G. Let T denote the set of z Z such that Γ XY z) contains at least p 3 d/t8s) s+1 monochromatic edges under κ. Since every C z occurs, no Γ XY z) can contain more than t 4s 2 d XY z)/t 2 16s 2 p 3 d/t monochromatic edges under κ. Therefore T 16s2 p 3 d t + n T ) p 3 d t8s) p3 dn s+1 4t8s) s. From this it follows that T > n/8s) s+2. Since every C z occurs, for every z T, Γ XY z) contains monochromatic edges of at least p 3 d t8s) s+1 t 2 16s 2 p 3 d > 2t 8s) s+3 different colors under κ. Let T z,κ be this set of colors on monochromatic edges of Γ XY z). We assign random lists to Z of size s from [t]. In order for H, and therefore H, to have the electronic journal of combinatorics ), #R129 9
10 a list coloring extending κ, it cannot be that some list at a vertex z T is contained in the set T z,κ. Let C κ be the event that no list at any vertex z T is contained in T z,κ. By 4) with K = 8s) s+3 /2, ) 2t/8s) s+3 and therefore PC κ ) < 1 2t/8s) s+3 s t s) s > 1 2K) s ) t s )) T < exp T ) < exp n ) 2K) s 8s) 2 t using that T > n/8s) s+2. By 2), PC κ ) < s 3pn, and since there are at most s X Y s 3pn colorings κ of X Y, we deduce that there exists a list assignment to the vertices of Z for which no C κ occurs. In words, there is an assignment of lists to the vertices of Z such that for any coloring κ of X Y, some z Z cannot be properly colored from its list. For this list assignment, no coloring of H exists. This completes the proof. 5 Note added in proof We have learned that the list coloring problem for linear and uniform hypergraphs has been studied independently by Alon and Kostochka [3]. They prove a more general version of Theorem 1, in that they consider r-uniform hypergraphs for r 3, and they do not restrict to d-regular hypergraphs but give bounds in terms of the average degree d. When specialised to the setting of Theorem 1, their results give similar bounds, and in particular we still do not know whether there exist 3-uniform d-regular hypergraphs with list chromatic number olog d) as d. 6 Appendix We chose s = log d) 1/2 5 log log d) 1/2 and t = 8s) ss+4) and put p := 1/8s) 3 t. If d is a large enough constant, we claim that the following three inequalities hold: t exp s 2 p 3 d/4t 2 ) < 1/64d 2 6) exp n/8s) 2 t) < s 3pn 7) exp p 2 n/8) < exp n/d 2 ). 8) To verify the inequalities 6), 7), 8) we first observe that with the given definitions we have s 2s2 < d 1/5 and so s s2 < d 1/10. Thus when d is large enough we find t = 8s) ss+4) < d 1/9. Therefore to prove 6) we note that for large enough d, t exp s 2 p 3 d/4t 2 ) < d 1/9 exp s 2 d/48s) 9 t 5 ) < d 1/9 exp d 1/3 ) < 1/64d 2. For 7) it suffices to show 3p log s < 1/64s 2 t, which is immediate from the definition of p. Finally for 8) we want 1/d 2 < p 2 /8, so since p 2 = 1/8s) 6 t 2 > 1/d 1/3 the inequality holds provided d 5/3 > 8. the electronic journal of combinatorics ), #R129 10
11 Lemma 6 Let s, t be positive integers and suppose that t/k 2s. Then ) ) t/k t > 2K) s. s s Proof By definition we have ) t/k > s t/k s)s s! > 1 s! t ) s. 2K On the other hand and the result follows. ) t ts s s! Acknowledgments This work was done while the authors were visiting the Institute for Pure and Applied Mathematics at the University of California, Los Angeles. The authors wish to thank IPAM for their support. References [1] Alon, N., Degrees and choice numbers, Random Structures & Algorithms ), [2] Alon, N., Restricted colorings of graphs. In: K. Walker, Editor, Surveys in Combinatorics, Proc 14th British Combinatorial Conference, London Mathematical Society Lecture Notes Series 187, Cambridge Univ. Press 1993), [3] Alon, N., Kostochka, A, Hypergraph list coloring and Euclidean Ramsey theory, submitted, [4] Alon, N., Krivelevich, M., The choice number of random bipartite graphs, Annals of Combinatorics ), [5] Alon, N., Spencer, J. The Probabilistic Method, Wiley-Interscience, [6] Erdős, P., On the combinatorial problems I would most like to see solved, Combinatorica ), [7] Erdős, P., On a combinatorial problem. II. Acta Mathematica Academiae Scientiarum Hungaricae ), [8] Erdős, P., Lovász, L., Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets A. Hajnal et al, eds.), North-Holland, Amsterdam 1975), the electronic journal of combinatorics ), #R129 11
12 [9] Erdős, P., Rubin, A., Taylor, H., Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium ), [10] Haxell, P., Pei, M., On list coloring Steiner triple systems, Journal of Combinatorial Designs ), [11] Kahn, J., Coloring nearly-disjoint hypergraphs with n + on) colors, Journal of Combinatorial Theory A ), the electronic journal of combinatorics ), #R129 12
List coloring hypergraphs
Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity
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 informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More 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 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 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 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 informationSize and degree anti-ramsey numbers
Size and degree anti-ramsey numbers Noga Alon Abstract A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-ramsey number of H, denoted
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
More 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 informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationChoosability and fractional chromatic numbers
Choosability and fractional chromatic numbers Noga Alon Zs. Tuza M. Voigt This copy was printed on October 11, 1995 Abstract A graph G is (a, b)-choosable if for any assignment of a list of a colors to
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 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 informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More 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 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 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 informationColoring Uniform Hypergraphs with Few Colors*
Coloring Uniform Hypergraphs with Few Colors* Alexandr Kostochka 1,2 1 University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; e-mail: kostochk@mathuiucedu 2 Institute of Mathematics, Novosibirsk
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationarxiv: v2 [math.co] 10 May 2016
The asymptotic behavior of the correspondence chromatic number arxiv:602.00347v2 [math.co] 0 May 206 Anton Bernshteyn University of Illinois at Urbana-Champaign Abstract Alon [] proved that for any graph
More informationAn asymptotically tight bound on the adaptable chromatic number
An asymptotically tight bound on the adaptable chromatic number Michael Molloy and Giovanna Thron University of Toronto Department of Computer Science 0 King s College Road Toronto, ON, Canada, M5S 3G
More informationPaul Erdős and the Probabilistic Method
Paul Erdős and the Probabilistic Method Noga Alon 1 The Probabilistic Method The Probabilistic Method is one of the most significant contributions of Paul Erdős. Indeed, Paul himself said, during his 80th
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 informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More 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 informationIndependence numbers of locally sparse graphs and a Ramsey type problem
Independence numbers of locally sparse graphs and a Ramsey type problem Noga Alon Abstract Let G = (V, E) be a graph on n vertices with average degree t 1 in which for every vertex v V the induced subgraph
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 informationProbabilistic Method. Benny Sudakov. Princeton University
Probabilistic Method Benny Sudakov Princeton University Rough outline The basic Probabilistic method can be described as follows: In order to prove the existence of a combinatorial structure with certain
More informationarxiv: v1 [math.co] 24 Apr 2014
On sets of integers with restrictions on their products Michael Tait, Jacques Verstraëte Department of Mathematics University of California at San Diego 9500 Gilman Drive, La Jolla, California 9093-011,
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 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 informationOn splitting digraphs
On splitting digraphs arxiv:707.03600v [math.co] 0 Apr 08 Donglei Yang a,, Yandong Bai b,, Guanghui Wang a,, Jianliang Wu a, a School of Mathematics, Shandong University, Jinan, 5000, P. R. China b Department
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 informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationLIST COLORING OF COMPLETE MULTIPARTITE GRAPHS
LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS Tomáš Vetrík School of Mathematical Sciences University of KwaZulu-Natal Durban, South Africa e-mail: tomas.vetrik@gmail.com Abstract The choice number of
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 informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationDegree Ramsey numbers for even cycles
Degree Ramsey numbers for even cycles Michael Tait Abstract Let H s G denote that any s-coloring of E(H) contains a monochromatic G. The degree Ramsey number of a graph G, denoted by R (G, s), is min{
More informationProduct Representations of Polynomials
Product Representations of Polynomials Jacques Verstraëte Abstract For a fixed polyomial f Z[X], let ρ k (N denote the maximum size of a set A {1, 2,..., N} such that no product of k distinct elements
More informationAn Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes)
An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes) Nicholas J. A. Harvey University of British Columbia Vancouver, Canada nickhar@cs.ubc.ca Jan Vondrák
More informationarxiv: v1 [math.co] 12 Jul 2017
A SHARP DIRAC-ERDŐS TYPE BOUND FOR LARGE GRAPHS H.A. KIERSTEAD, A.V. KOSTOCHKA, AND A. McCONVEY arxiv:1707.03892v1 [math.co] 12 Jul 2017 Abstract. Let k 3 be an integer, h k (G) be the number of vertices
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
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 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 informationIMA Preprint Series # 2385
LIST COLORINGS WITH DISTINCT LIST SIZES, THE CASE OF COMPLETE BIPARTITE GRAPHS By Zoltán Füredi and Ida Kantor IMA Preprint Series # 2385 ( October 2011 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationChromatic Ramsey number of acyclic hypergraphs
Chromatic Ramsey number of acyclic hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas@renyi.hu Alexander
More 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 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 informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More 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 informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint
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 informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
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 information1. Introduction Given k 2, a k-uniform hypergraph (in short, k-graph) consists of a vertex set V and an edge set E ( V
MINIMUM VERTEX DEGREE THRESHOLD FOR C 4-TILING JIE HAN AND YI ZHAO Abstract. We prove that the vertex degree threshold for tiling C4 (the - uniform hypergraph with four vertices and two triples in a -uniform
More informationList colouring hypergraphs and extremal results for acyclic graphs
List colouring hypergraphs and extremal results for acyclic graphs by Martin Pei A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More 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 informationOn decompositions of complete hypergraphs
On decompositions of complete hypergraphs Sebastian M Cioabă 1, Department of Mathematical Sciences, University of Delaware, Newar, DE 19716, USA André Kündgen Department of Mathematics, California State
More informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
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 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 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 informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationLecture 24: April 12
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 24: April 12 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
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 discrepancy of permutation families
The discrepancy of permutation families J. H. Spencer A. Srinivasan P. Tetali Abstract In this note, we show that the discrepancy of any family of l permutations of [n] = {1, 2,..., n} is O( l log n),
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
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 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 informationThe Lovász Local Lemma : A constructive proof
The Lovász Local Lemma : A constructive proof Andrew Li 19 May 2016 Abstract The Lovász Local Lemma is a tool used to non-constructively prove existence of combinatorial objects meeting a certain conditions.
More informationQuadruple Systems with Independent Neighborhoods
Quadruple Systems with Independent Neighborhoods Zoltan Füredi Dhruv Mubayi Oleg Pikhurko Abstract A -graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both
More informationUsing Lovász Local Lemma in the space of random injections
Using Lovász Local Lemma in the space of random injections Linyuan Lu László Székely University of South Carolina {lu, szekely}@math.sc.edu Submitted: Nov 6, 2006; Accepted: Sep 3, 2007; Published: Sep
More 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 informationarxiv: v1 [math.co] 18 Nov 2017
Short proofs for generalizations of the Lovász Local Lemma: Shearer s condition and cluster expansion arxiv:171106797v1 [mathco] 18 Nov 2017 Nicholas J A Harvey Abstract Jan Vondrák The Lovász Local Lemma
More 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 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 informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationAn extension of the Moser-Tardos algorithmic local lemma
An extension of the Moser-Tardos algorithmic local lemma Wesley Pegden January 26, 2013 Abstract A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics
More informationMaximizing the number of independent sets of a fixed size
Maximizing the number of independent sets of a fixed size Wenying Gan Po-Shen Loh Benny Sudakov Abstract Let i t (G be the number of independent sets of size t in a graph G. Engbers and Galvin asked how
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationLecture 5: Probabilistic tools and Applications II
T-79.7003: Graphs and Networks Fall 2013 Lecture 5: Probabilistic tools and Applications II Lecturer: Charalampos E. Tsourakakis Oct. 11, 2013 5.1 Overview In the first part of today s lecture we will
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
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 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 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 informationTiling on multipartite graphs
Tiling on multipartite graphs Ryan Martin Mathematics Department Iowa State University rymartin@iastate.edu SIAM Minisymposium on Graph Theory Joint Mathematics Meetings San Francisco, CA Ryan Martin (Iowa
More informationThe Erdős-Hajnal hypergraph Ramsey problem
The Erdős-Hajnal hypergraph Ramsey problem Dhruv Mubayi Andrew Suk February 28, 2016 Abstract Given integers 2 t k +1 n, let g k (t, n) be the minimum N such that every red/blue coloring of the k-subsets
More informationDiscrete Mathematics 22 (1978) North-Holland Publishing Company ON ADDITIVE PARTITIONS OF INTEGERS K. ALLADI University of California, Los A
Discrete Mathematics 22 (1978) 20 1-211. North-Holland Publishing Company ON ADDITIVE PARTITIONS OF INTEGERS K. ALLADI University of California, Los Angeles, CA 90024, U.S.A. P. ERDŐS The Hungarian Academy
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 informationJacques Verstraëte
2 - Turán s Theorem Jacques Verstraëte jacques@ucsd.edu 1 Introduction The aim of this section is to state and prove Turán s Theorem [17] and to discuss some of its generalizations, including the Erdős-Stone
More information