Disjoint Subgraphs in Sparse Graphs 1
|
|
- Morris Malone
- 5 years ago
- Views:
Transcription
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 Abstract Häggkvist and Scott asked whether there exists a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of minimum degree at least 1 2 (k2 + 35k + 2) and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answering the above question in the affirmative. The coefficient of k 2 cannot be decreased and, in this sense, this result is best possible. We also consider the problem of finding isomorphic disjoint topological subgraphs in a graph of appropriate average degree. 1. Introduction It is well-known that a graph of average degree at least two contains at least one cycle. From this it is easy to deduce that if k is a natural number, a graph of order n containing at least n + k 1 edges contains k distinct cycles. Corradi and Hajnal [4] considered the requirement that the k cycles be disjoint. They proved that a graph of minimum degree at least 2k and order at least 3k contains k disjoint cycles. Under the same minimum degree condition, Egawa [5] showed that a sufficiently large graph contains k disjoint cycles of the same length. In a recent paper by Bondy and Vince [3], it was shown that if G is a graph of 1 accepted for publication,
2 order at least three containing at most two vertices of degree at most two, then G contains a pair of cycles of consecutive lengths or consecutive even lengths. The following general theorem was established by the author (a special case of Theorem 1 in [16]): Theorem 1. Let k be a natural number and G a bipartite graph of average degree at least 4k. Then there exist cycles of k consecutive even lengths in G. Moreover, the shortest of these cycles has length at most twice the radius of G. Theorem 1 addresses the problem of finding cycles of consecutive even lengths in a graph of sufficient average degree. In this paper, we attack the associated problem of finding disjoint cycles of consecutive even lengths. All graphs considered in this paper are simple and finite. Throughout this paper, K s,t denotes the complete bipartite graph with s vertices in one colour class and t vertices in the other. Also, H denotes the order of a graph H and e(h) denotes the number of edges in H. The word disjoint will be taken to imply vertex-disjoint. 2. Disjoint Cycles of Consecutive Even Lengths. Häggkvist and Scott [8] asked whether there exists a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains disjoint cycles of k consecutive even lengths. We answer this question in the affirmative, by proving the following theorem: Theorem 2. Let k be a natural number. Then there exists n k such that if G is a graph of order at least n k and minimum degree at least 1 2 (k2 + 35k + 2), then G contains disjoint cycles of k consecutive even lengths. Theorem 2 is essentially best possible since for s k = k and n 2s k 2, the complete bipartite graph K sk 1,n s k +1 contains no disjoint cycles of k consecutive even lengths and has minimum degree s k 1 = 1 2 (k2 + 3k). From the proof of Theorem 2, we may also deduce that a sufficiently large graph of average degree at least k k + 1 contains disjoint cycles of k consecutive even lengths this is also best possible in view of the example of the graph F above. It will follow from the proof of Theorem 2 that a sufficiently large graph, of minimum degree at least 16k + 3 and containing no cycle of length four, contains disjoint cycles of k consecutive even lengths. This type of difference between general graphs and graphs containing no cycle of length four was first observed by Häggkvist (see Thomassen [15], page 138). A similar phenomenon occurs for graphs of bounded maximum degree. In order to prove Theorem 2, we first need two lemmas. The first lemma is a consequence of a lemma due to Kostochka and Pyber (see Lemma 1.1 page 84 in [12]): 2
3 Lemma 3. Let r be a natural number, c a positive real number, and let G be a graph of order n and size at least cn 1+ 1 r. Then G contains a subgraph of average degree at least c and radius at most r. The second lemma is proved using a standard counting argument: Lemma 4. Let s and t be natural numbers and let G be a bipartite graph with colour classes A and B. If A > t B s+1 and e(g) s A, then G contains K s,t. ) Proof. If v A and the degree of v is d(v), then there exist subsets of B of size s in the neighbourhood of v. Since A > t B s+1, d(v) s v A 1 s s+1 v A d(v) s 1 s s+1 1 A s 1 1 s s+1 1 s s+1 ( d(v) s s d(v) v A 1 e(g)s A s 1 1 A s 1 ss A s A /s > t B s t B. s So there exists a subset of B of size s contained in the intersection of the neighbourhoods of at least t vertices of A. This implies that K s,t G. We will see that the following result implies Theorem 2: Theorem 5. Let k, m be positive integers and let G be a graph of order n and minimum degree at least m + 16k + 1. Then G contains at least (8k log 2 n) 4 n 1/(m+1) disjoint sets of k cycles of the same k consecutive even lengths or G contains K m,m. Proof. Let N = (8k log 2 n) 4 n 1/(m+1). Suppose G = G 0 contains cycles of k consecutive even lengths. Define r 0 = min{r : G contains cycles of lengths 2r, 2r + 2,..., 2r + 2k 2}. Let X 0 be a subgraph of G 0 comprising the union of cycles of lengths 2r 0, 2r 0 + 2,..., 2r 0 + 2k 2 in G 0. Let G 1 = G 0 V (X 0 ). If G 0, G 1,..., G i are defined, and G i contains k cycles of consecutive even lengths, define r i = min{r : G i contains cycles of lengths 2r, 2r + 2,..., 2r + 2k 2}. Let X i be a subgraph of G i comprising the union of cycles of lengths 2r i, 2r i + 2,..., 2r i + 2k 2 and let G i+1 = G i V (X 0 ). Note that the integers r 0, r 1, r 2,... form a non-decreasing sequence. If at least N of the integers r i are identical, say r i = r i+1 =... = r i+k 1 = t, then G = G 0 contains k disjoint cycles of lengths 2t, 2t + 2,..., 2t + 2k 2, contained in X i, X i+1,..., X i+k 1 respectively. Therefore suppose no N of the integers r i are identical. 3
4 We claim that G = G 0 contains cycles of k consecutive even lengths, the shortest of which has length at most 16k(log 2 n) 2. Let B be a spanning bipartite subgraph of G 0 containing at least half of the edges of G 0. Set r = 16k(log 2 n) 2. Then n 1/r 2 1/(16k) 1 + 1/(16k) and e(b) 1 (m + 16k + 2)n 4 1 (16k + 1)n 4 4kn 1+ 1 r. By Lemma 3, applied to B, there exists a subgraph H of B of average degree at least 4k and radius at most r 16k(log 2 n) 2. By Theorem 1, H (and therefore G 0 ) contains cycles of k consecutive even lengths, the shortest of which has length at most 32k(log 2 n) 2. This shows that r 0 16k(log 2 n) 2. Conversely, whenever G i does not contain cycles of k consecutive even lengths, the shortest having length at most 32k(log 2 n) 2, G i has average degree at most 16k + 1. As G is finite, there exists a non-negative integer j such that r j 16k(log 2 n) 2 and G j+1 does not contain cycles of k consecutive even lengths, the shortest having length at most 32k(log 2 n) 2. Let G = G j+1 and G = G V (G ). Noting that X i 2k(r i + k 2) and that no N of the integers r i are identical, j r G X i (N 1) 2k(i + k 2) i=0 i=0 (N 1)kr(r + 1) + 2k(k 1)(k 2)(r + 1) Nk 2 r 2 N (4k log 2 n) 4 < 1 2 n1/(m+1). As G contains no cycles of k consecutive even lengths with shortest cycle of length at most 32k(log 2 n) 2, G has average degree at most 16k + 1. Let B be the bipartite graph spanned by the edges of G with one end in G and the other in G. Then e(b ) (m + 16k + 1) G (16k + 1) G m G We also have m G m+1 2 m 1 mn n G = G. Applying Lemma 4 to B, we find a complete bipartite subgraph K m,m in B, as required. Proof of Theorem 2. When s k = k+2 2 1, the complete bipartite graph K sk,s k contains disjoint cycles of lengths 4, 6,..., 2k+2. We therefore assume that G does not contain K sk,s k. By Theorem 5, with m = s k, G contains at least N = (8k log 2 n) 4 n 1/(m+1) sets of k disjoint cycles of the k same consecutive even lengths. If N k, we select an appropriate cycle 4
5 from each of these sets of k cycles to obtain disjoint cycles of k consecutive even lengths. The inequality N k is satisfied, for example, when n (16s k ) 16s k. We can also give an average degree version of Theorem 2: a sufficiently large graph of average degree at least k k + 2 contains disjoint cycles of k consecutive even lengths. This average degree version is essentially best possible as seen by the graph K k 2 +3k 1 and also by the example presented after the statement of Theorem 2. In view of this example, we pose the following conjecture: Conjecture. Let k be a positive integer and s k = k Then any graph of minimum degree at least s k and order at least 2s k contains disjoint cycles of k consecutive even lengths. If G is a graph of order 2s k and minimum degree at least s k then this conjecture says that G contains disjoint cycles of lengths 4, 6,..., 2k + 2: this is a special case of a conjecture of El-Zahar [6], which we return to in section 4. Erdős and Burr [7] conjectured that if k + lz contains an even number, then there exists c k such that every graph of average degree at least c k contains a cycle of length l modulo k. This conjecture was proved by a number of authors (see [16] for references). Their proofs are all strengthened by Theorem 1, which guarantees that c k can be taken to be linear in k. We consider the natural associated problem of finding vertex disjoint cycles of length l modulo k in a sufficient large graph of average degree at least d k. The existence of d k follows easily from Theorem 5, as we shall see in the proof of Theorem 6 below. In the statement of the next result, π(k) = 1 if k is odd and π(k) = 0 if k is even: Theorem 6. Let k 2 and r be positive integers and let t 1, t 2,..., t r Z k. Suppose t i +kz contains an even integer for i = 1, 2,..., r. Define r m = (t i + kπ(t i )π(k)) + kπ(k) {t i < 4 : π(t i ) = 0} i=1 Then every sufficiently large graph of average degree at least 1 2m + 16k + 1 contains disjoint cycles of lengths t 1, t 2,..., t r modulo k. Proof. It is not hard to check that if t i + kz contains an even integer, then m is even. If G contains K m/2,m/2, then G contains the required r disjoint cycles: this has to be verified by cases (for example, if t i < 4 is even and k is odd, then a shortest cycle of length t i (mod k) in a complete bipartite graph must have length 2k + t i ). By Theorem 5, provided (8k log 2 n) 4 n 1/(m+1) r, G contains the required disjoint cycles. There certainly exists n k,r such that if n n k,r, the inequality is satisfied. 3. Disjoint Topological Subgraphs 5
6 Given a graph H, a topological H is a graph obtained by arbitrarily subdividing the edges of H. We now turn to the problem of finding disjoint isomorphic topological H in a graph G. This is a natural generalization of the problem of finding disjoint cycles of the same length in a graph G: in this case, H = K 3. In this direction, Egawa [5] showed that a sufficiently large graph of minimum degree at least 2k contains k disjoint cycles of the same length. A short proof of this fact was found by the author [17]. Mader [14] was the first to establish the existence of a constant c t such that every graph of average degree at least c t contains a topological complete graph of order t. Mader s showed that c t can be taken to be at most 2 O(t2). Since then, c t has been reduced to a quadratic polynomial in t by deep theorems of Bollobás,Thomason [2] and Komlós, Szemerédi [11], which is best possible. Kostochka and Pyber [12] used Mader s result to show that dense graphs contain small topological complete graphs: Proposition 7. Let H be a graph of order h and size e(h) and let G be a graph of order n and size at least 16 e(h) n 1+ε, where ε > 0. Then G contains a topological H of order at most 16e(H)(log 2 h)/ε. The theorems of Bollobás and Thomason and Komlós and Szemerédi do not give an effective upper bound on the size of the topological complete graph. Given a graph H, we now intend to apply the method of the proof of Theorem 2 to find many disjoint isomorphic topological H subgraphs in a graph of high enough average degree. Our result will give an essentially best possible minimum degree (or average degree) condition for find k disjoint topological H in a graph G. We write e for the base of the natural logarithm and emphasize that we will not optimize constants in what follows. Theorem 8. Let k be a positive integer, and let H be a graph of order h and independence number α. Then there exist constants C and K, depending only on H, such that if G is a graph of minimum degree at least k(h α) + K k 1 1/(h α)2 and order n > Ck, then G contains k disjoint isomorphic topological H. Proof. If H is empty, then we may take C = h and K to be arbitrary. If h α = 1 (so e(h) = 1), then we may take C = h + 1. This follows since a graph of order at least 3k 2 contains k disjoint edges and we require k(h 2) other vertices in G to find k disjoint isomorphic topological H (in this case, we may even take K = 0). For the rest of the proof, we assume h α > 1 (and therefore e(h) > 1). We prove the Theorem with C = (64e(H) log 2 h) 2e(H) and K = 16 e(h)+1. Note that for k = 1, G already contains a topological K h and therefore a topological H. For the remainder of the proof k 2. The number of isomorphic topological H of order m is, very roughly, at most the number of representations of m h as an ordered sum of e(h) non-negative integers. This number is precisely m h + e(h) 1. e(h) 1 6
7 Let G = G 0 and define G 1 = G 0 V (H 0 ) where H 0 is a smallest topological H appearing in G. By Proposition 7, with ε = (2 log k n) 1, we can guarantee that H 0 32e(H) log 2 h log k n, since G 0 has size at least e(H)+1 k 3/4 n 16 e(h) kn 16 e(h) n 1+ε. In general, if G i 1 is defined, let G i = G i 1 V (H i 1 ) where H i 1 is the smallest topological H appearing in G i 1. We continue this procedure until we reach a stage j where G j does not contain a topological H of order at most 32e(H) log 2 h log k n. Let G = G j and G = G V (G j ). If k of the H i are isomorphic in G then the requirements of the theorem are met, so we suppose this is not the case. For convenience, let m = 32e(H) log 2 h log k n. Then, m h + e(h) 1 G (k 1)m e(h) 1 2m km e(h) 1 km(2m) e(h) 1 k(2m) e(h) k(64e(h) log 2 h) e(h) (log k n) e(h) k C(log k n) e(h). It is clear that G has average degree at most 2 16 e(h) k 1 2 K k1 1/(h α)2 otherwise, by Proposition 7, G = G j contains a small topological H. This implies that at most half the vertices of G have at least 1 2 K k1 1/(h α)2 neighbours in G. As G has minimum degree at least k(h α) + K k 1 1/(h α)2, this implies that a set S of at least half the vertices of G have at least k(h α) K k1 1/(h α)2 neighbours in G. We now consider the bipartite graph B spanned by edges between S and G. If B contains a complete bipartite graph K h α,e(h), then B contains a topological H in which every edge not incident with an independent set is subdivided. The graph B contains such a complete bipartite graph whenever ( d(v) G ) > (e(h) 1). h α h α v S If we find k disjoint complete bipartite graphs K (h α),e(h) in B, then Theorem 8 is proved. By successively removing K h α,e(h) from B, and applying the above condition in the remaining graph, we see that a sufficient condition for B to contain k disjoint complete bipartite graphs K h α,e(h) is d(v) (k 1)(h α) h α v S ( G ) > (e(h) 1) h α 7 ( )
8 where S is any subset of S obtained by removing (k 1)e(H) vertices from S. We now show that this holds under the minimum degree condition for vertices in S and our choice of C = (64e(H) log 2 h) 2e(H). The first inequality we demonstrate is: ( (h α) G n G + ke(h) + e(h)k 1/(h α) ) h α. k Since G k C(log k n) e(h) and h α 2, it is sufficient to show that: n 2k C(log k n) e(h) + e(h) ( k (h α) C(log k n) e(h)) h α. If this inequality holds when n = Ck+ kc h, then it holds for all n Ck+ kc h. However, as e(h)(h α)(1 + log 2 C) e(h) C, we have: 2k C(log k Ck) e(h) + ( k e(h) (h α) C(log k Ck) e(h)) h α Ck + kc h. Therefore the lower bound for n holds. This implies that: The minimum degree condition gives: S e(h)k 1/(h α) [(h α) G /k] h α. d(v) (k 1)(h α) > k 1 1/(h α)2, so it follows that the summands in ( ) are each greater than: (h α) (h α) k h α 1/(h α), using the inequality ( a b ) (a/b) b. Our sufficient condition for k disjoint K h α,e(h) in B is now satisfied: the sum on the left in ( ) is at least: S (h α) (h α) k h α 1 (h α) ( G > e(h)k h α k > (e(h) 1) ( G h α ) h α So B contains k disjoint K h α,e(h) and therefore G contains k disjoint isomorphic topological H. The above theorem is best possible in the sense that if H has order h and independence number α, then the complete bipartite graph K k(h α) 1,n does not contain k disjoint isomorphic topological H, as the following simple lemma attests: Lemma 9. Let H be a graph of independence number α and order h. Let m be the minimum number of vertices in the smaller colour class in a bipartite topological H, taken over all ). 8
9 bipartite topological H. Then m = h α. Consequently, K k(h α) 1,n does not contain k vertex disjoint topological H. Proof. By subdividing all the edges of H not incident with a maximum independent set, we see that m h α. Let A be the minimum colour class over all bipartite topological H so A = m and let B be the larger colour class. If A < h α, then B contains a set B of more than α vertices of H. This set of vertices of H induces a graph with at least B α edges, by definition of α. Each of these edges is therefore subdivided and the new vertices form a set A A\V (H) of at least α B. This gives m A + A V (H) B α + h B V (H) = h α, as required. This implies that if k disjoint topological H fit into a complete bipartite graph, then the smaller colour class must have size at least k(h α). The important point is that C is a constant depending on H only and the deviation from k(h α) in the minimum degree condition is o(k). The proof of Theorem 8 can also be used to show that there exist constant C and K, depending only on H, such that if G is a graph of order n C k and average degree at least 2k(h α) + K k 1 1/(h α)2 contains k disjoint isomorphic topological H. 4. Some Questions Tiling and Disjoint Topological Subgraphs. Alon and Yuster [1] proved that if H is any graph of order h, then for all ε > 0 then there exists n 0 (ε, h) such that whenever n n 0 (ε, h) and h divides n, each graph of order n and minimum degree at least (1 1/χ(H) + ε)n contains n/h disjoint copies of H (an H-factor). Komlós, Sárközy and Szemerédi (see [10]) have recently generalized this, proving that there exists n 1 (H) and a constant K, depending only on H, such that if G is a graph of minimum degree at least (1 1/χ(H)) + K then G contains n/h disjoint copies of H (An H-tiling). In general, K cannot be taken to be zero: if H is an unbalanced complete bipartite graph, then K n,n, in general, does not contain 2n/h disjoint copies of H. A conjecture of Alon and Yuster remains: it may be true we can tile all but a constant number (depending on H) of vertices of a sufficiently large graph of order n and minimum degree at least (1 1/χ(H))n with copies of H. Theorem 8 implies that there exists k(ε, h) and n(h) such that if n n(h) kh and k k(ε, h), then any graph of order n and minimum degree at least (1 1/χ(H)+ε)kh contains k disjoint isomorphic topological H. By the result of Alon and Yuster, this is also true when n = kh. For 2kh < n < h 2, it is not necessarily true. This follows since (1 1/χ(H) + ε)kh < n/2 for ε < 1/χ(H) whereas k disjoint topological K h are all forced to be nonbipartite. If H is already bipartite, then we ask the following question: 9
10 Question 1. Let H be a bipartite graph of order h and independence number α. Does there exists k 0 (H) and a constant K, depending only on H, such that if G is a graph of minimum degree at least k(h α)+k and order at least kh and k k 0 (H), then G contains k disjoint isomorphic topological H? The question has a positive answer when the order of G is exactly kh and H is balanced, by the result of Komlós, Sárközy and Szemerédi. Another difficult question is the optimal value of K when k is fixed: for example, if k = 2, can we take K to be a polynomial in h for all H with H = h? Cycles of the Same Length. Our second question concerns disjoint cycles of the same length. Komlós, Sárközy and Szemerédi (see [10]) have shown that every sufficiently large graph of minimum degree at least n/2 has a perfect tiling with quadrilaterals. More generally, a beautiful conjecture of El-Zahar [6] was recently proved by Abbasi (see [10]): if ri=1 n i = n and n i 3 for i = 1, 2,..., r, then every sufficiently large graph of minimum degree at least r i=1 n i /2 contains disjoint cycles of lengths n 1, n 2,..., n r. We ask the following question, which extends the result when all n i are equal and even: Question 2. Let k, g 2. Does every graph of minimum degree at least gk and order at least 2gk contain k equicardinal disjoint cycles of length at least 2g? Even in the case k = 2 and g = 2, the answer is not known. Wang [18] proposed the following conjecture for balanced bipartite graphs: does every sk sk bipartite graph of minimum degree greater than (s 1)k contain k disjoint K s,s? This conjecture was proved by Wang for k 4. Chromatic Number. It is difficult to obtain good upper bounds on the chromatic number of an arbitrary graph. We ask the following question: Question 3. Does there exists an absolute constant c such that if G is a graph of chromatic number at least c, then G contains a pair of disjoint odd cycles of the same length? It is easily seen that a graph of chromatic number at least 3k contains k disjoint odd cycles. As a graph of chromatic number at least c > 0 contains an odd cycle of length O(n 1/(c 2) ), we might try to answer the question in the affirmative by showing that a graph of sufficient chromatic number c contains at least, say, n ε disjoint subgraphs of chromatic number at least 2 + 1/ε. However, this cannot be done since Erdős proved that there exist graphs of chromatic number at least c in which every subgraph of order εn is 3-chromatic. Difficulties also arise if we try to remove disjoint short odd cycles since the chromatic number is severely affected by such action (i.e. we can t hope to do it more than c times if the chromatic number is 3c.) Question 4. Does there exist a constant c such that every graph of chromatic number at least c contains a pair of disjoint cycles of consecutive odd lengths? 10
11 The same question can be asked for cycles of consecutive lengths. The proof of Theorem 1 in [15] easily shows that a graph of chromatic number at least 2k + 2 contains cycles of k consecutive lengths. However, the same problems arise as for Question 3. Finally, we could ask some questions such as: does there exist c such that every graph of chromatic number at least c contains a pair of disjoint totally odd (i.e. every edge is subdivided an odd number of times) topological K 4, but even finding one such topological K 4 is very difficult. Asymptotic Tiling of Regular Graphs. We now briefly consider disjoint (but not necessarily isomorphic) topological subgraphs in regular graphs. It is easily seen that for r sufficiently large, at least one half of the vertices of an r-regular graph can be covered by disjoint topological H (see below). Jørgensen and Pyber [9] have discussed problems involving covering the edges of a graph with topological subgraphs. We consider an analogue for covering vertices. Let H be a fixed graph. We let f(r, H) denote the maximum proportion of vertices that can be covered with disjoint topological H in any r-regular graph. We define f (H) = lim inf f(r, H) r f + (H) = lim sup f(r, H). r We observe, as mentioned above, that 1/2 f (H) f + (H) 1 for every H. The lower bound follows by removing topological H from an r-regular graph G until we obtain a graph F containing no topological H. Then the average degree of F is bounded above by a constant c > 0 depending only on H, by the results of Mader [14]. As G is r-regular, the number of edges between F and the remainder of G is at most r( G F ), but at least (r c) F. Therefore F 1 2 (1 c r ) 1 G and hence f (H) 1 2. We say that regular graphs have an asymptotic topological H tiling if f (H) = 1. When H is a complete graph of order two or three, the problem above becomes the problem of tiling with paths or cycles respectively. Petersen s 2-factor theorem (see [13] page 54) states that for k 1, every 2k-regular graph contains a 2-factor. This shows that if H has order at most three, then f + (H) = 1. The author does not know of any graph H for which regular graphs do not have an asymptotic topological H tiling. This problem may prove to be interesting: particular cases of interest are when H is a cycle of fixed length, or H is a complete graph of order at least four. Acknowledgements I would like to thank Andrew Thomason and the referee for their invaluable suggestions and comments. References 11
12 [1] Alon, N, Yuster, R. H-factors in dense graphs. J. Combin. Theory Ser. B 66 (2) (1996), [2] Bollobás, B, Thomason, A. Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs, Europ. J. Combin. 19 (8) (1988) [3] Bondy, J, Vince, A. Cycles in a graph whose lengths differ by one or two, J. Graph Theory 27 (1998) [4] Corradi, K, Hajnal, A. On the Maximal Number of Independent Circuits of a Graph, Acta Math. Acad. Sci. Hungar. 14 (1963) [5] Egawa, Y. Vertex-Disjoint Cycles of The Same Length, J. Combin. Theory Ser. B 66 (1996)
13 [6] El-Zahar, M. On circuits in graphs. Discrete Math. 50 (2-3) (1984), [7] Erdős, P. Some recent problems and results in graph theory, combinatorics, and number theory, Proc. Seventh S E Conf. Combinatorics, Graph Theory and Computing, Utilitas Math., Winnipeg, (1976) [8] Häggkvist, R, Scott, A. Arithmetic progressions of cycles, Preprint (1998). [9] Jørgensen, A, Pyber, L. Covering a graph by topological complete subgraphs, Graphs Combin. 6 (2) (1990) [10] Komlós, J. Tiling Turán Theorems, Cominatorica 20 (2), (2000) [11] Komlós, J, Szemerédi, E. Topological cliques in graphs II, Combin. Probab. Comput. 5 (1) (1996) [12] Kostochka, A, Pyber, L. Small topological complete subgraphs of dense graphs, Combinatorica 8 (1), (1988) [13] Lovász, L. Combinatorial Problems and Exercises, North Holland (1979). [14] Mader, W. Existenz gewisser Konfigurationen in n-gesättigten Graphen und in Graphen genügend grosser Kantendichte, Math. Ann. 194 (1971) [15] Thomassen, C. Girth in graphs, J. Combin. Theory Ser. B 35 (1983) [16] Verstraëte, J. Arithmetic progressions of cycles in graphs, Combin. Probab. Comput. 9 (4) (2000) [17] Verstraëte, J. Vertex-disjoint cycles in graphs, accepted in J. Combin. Theory Series B (2000). [18] Wang, H. Vertex-disjoint hexagons with chords in a bipartite graph, Discrete Math. 187 (1-3) (1996),
Note 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 informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More 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 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 informationLarge topological cliques in graphs without a 4-cycle
Large topological cliques in graphs without a 4-cycle Daniela Kühn Deryk Osthus Abstract Mader asked whether every C 4 -free graph G contains a subdivision of a complete graph whose order is at least linear
More informationCYCLES OF GIVEN SIZE IN A DENSE GRAPH
CYCLES OF GIVEN SIZE IN A DENSE GRAPH DANIEL J. HARVEY DAVID R. WOOD Abstract. We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least 4 kr contains k vertex
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 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 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 informationBipartite Graph Tiling
Bipartite Graph Tiling Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303 December 4, 008 Abstract For each s, there exists m 0 such that the following holds for
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 informationMinimum degree conditions for large subgraphs
Minimum degree conditions for large subgraphs Peter Allen 1 DIMAP University of Warwick Coventry, United Kingdom Julia Böttcher and Jan Hladký 2,3 Zentrum Mathematik Technische Universität München Garching
More informationPacking k-partite k-uniform hypergraphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 38 (2011) 663 668 www.elsevier.com/locate/endm Packing k-partite k-uniform hypergraphs Richard Mycroft 1 School of Mathematical
More informationA NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES OLEG PIKHURKO Abstract. The Turán function ex(n, F
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 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 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 informationSubdivisions of a large clique in C 6 -free graphs
Subdivisions of a large clique in C 6 -free graphs József Balogh Hong Liu Maryam Sharifzadeh October 8, 2014 Abstract Mader conjectured that every C 4 -free graph has a subdivision of a clique of order
More informationIndependent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
Journal of Combinatorial Theory, Series B 72, 104109 (1998) Article No. TB971794 Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs Carsten Thomassen Department of Mathematics,
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More 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 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 informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationOn the 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 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 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 informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
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 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 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 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 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 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 information1.1 Szemerédi s Regularity Lemma
8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices
More 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 information9 - The Combinatorial Nullstellensatz
9 - The Combinatorial Nullstellensatz Jacques Verstraëte jacques@ucsd.edu Hilbert s nullstellensatz says that if F is an algebraically closed field and f and g 1, g 2,..., g m are polynomials in F[x 1,
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More 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 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 informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationarxiv: v1 [math.co] 1 Dec 2016
LOCAL CONDITIONS FOR EXPONENTIALLY MANY SUBDIVISIONS HONG LIU, MARYAM SHARIFZADEH AND KATHERINE STADEN arxiv:1612.00206v1 [math.co] 1 Dec 2016 Abstract. Given a graph F, let s t (F) be the number of subdivisions
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationVertices of Small Degree in Uniquely Hamiltonian Graphs
Journal of Combinatorial Theory, Series B 74, 265275 (1998) Article No. TB981845 Vertices of Small Degree in Uniquely Hamiltonian Graphs J. A. Bondy Institut de Mathe matiques et Informatique, Universite
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
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 informationAn asymptotic multipartite Kühn-Osthus theorem
An asymptotic multipartite Kühn-Osthus theorem Ryan R. Martin 1 Richard Mycroft 2 Jozef Skokan 3 1 Iowa State University 2 University of Birmingham 3 London School of Economics 08 August 2017 Algebraic
More 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 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 informationOn the Pósa-Seymour Conjecture
On the Pósa-Seymour Conjecture János Komlós, 1 Gábor N. Sárközy, 2 and Endre Szemerédi 3 1 DEPT. OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NJ 08903 2 DEPT. OF COMPUTER SCIENCE, WORCESTER POLYTECHNIC
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationProof of a Tiling Conjecture of Komlós
Proof of a Tiling Conjecture of Komlós Ali Shooufandeh, 1 Yi Zhao 2 1 Department of Computer Science, Drexel University, Philadelphia, Pennsylvania 19104 2 Department of Mathematics, Statistics, and Computer
More informationAvoider-Enforcer games played on edge disjoint hypergraphs
Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing
More 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 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 informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationGraph Minors Theory. Bahman Ghandchi. Institute for Advanced Studies in Basic Sciences (IASBS) SBU weekly Combinatorics Seminars November 5, 2011
Graph Minors Theory Bahman Ghandchi Institute for Advanced Studies in Basic Sciences (IASBS) SBU weekly Combinatorics Seminars November 5, 2011 Institute for Advanced Studies in asic Sciences Gava Zang,
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More 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 informationInduced subgraphs of graphs with large chromatic number. IX. Rainbow paths
Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths Alex Scott Oxford University, Oxford, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544, USA January 20, 2017; revised
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 informationGraph Packing - Conjectures and Results
Graph Packing p.1/23 Graph Packing - Conjectures and Results Hemanshu Kaul kaul@math.iit.edu www.math.iit.edu/ kaul. Illinois Institute of Technology Graph Packing p.2/23 Introduction Let G 1 = (V 1,E
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 informationREGULARITY LEMMAS FOR GRAPHS
REGULARITY LEMMAS FOR GRAPHS Abstract. Szemerédi s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal
More informationPartitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute
More informationLondon E1 4NS, United Kingdom
PROOF OF THE 1-FACTORIZATION AND HAMILTON DECOMPOSITION CONJECTURES BÉLA CSABA 1, DANIELA KÜHN 2, ALLAN LO 2, DERYK OSTHUS 2 AND ANDREW TREGLOWN 3 1 Bolyai Institute, University of Szeged, H-6720 Szeged,
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
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 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 informationRainbow factors in hypergraphs
Rainbow factors in hypergraphs Matthew Coulson Peter Keevash Guillem Perarnau Liana Yepremyan March 27, 2018 Abstract For any r-graph H, we consider the problem of finding a rainbow H-factor in an r-graph
More information1-factor and cycle covers of cubic graphs
1-factor and cycle covers of cubic graphs arxiv:1209.4510v [math.co] 29 Jan 2015 Eckhard Steffen Abstract Let G be a bridgeless cubic graph. Consider a list of k 1-factors of G. Let E i be the set of edges
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 informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationList Decomposition of Graphs
List Decomposition of Graphs Yair Caro Raphael Yuster Abstract A family of graphs possesses the common gcd property if the greatest common divisor of the degree sequence of each graph in the family is
More informationOn the Regularity Method
On the Regularity Method Gábor N. Sárközy 1 Worcester Polytechnic Institute USA 2 Computer and Automation Research Institute of the Hungarian Academy of Sciences Budapest, Hungary Co-authors: P. Dorbec,
More 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 informationEwan Davies Counting in hypergraphs via regularity inheritance
Ewan Davies Counting in hypergraphs via regularity inheritance Article (Accepted version) (Refereed) Original citation: Davies, Ewan (2015) Counting in hypergraphs via regularity inheritance. Electronic
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 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 informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
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 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 informationThe Colin de Verdière parameter, excluded minors, and the spectral radius
The Colin de Verdière parameter, excluded minors, and the spectral radius Michael Tait Abstract In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all
More informationAn exact Turán result for tripartite 3-graphs
An exact Turán result for tripartite 3-graphs Adam Sanitt Department of Mathematics University College London WC1E 6BT, United Kingdom adam@sanitt.com John Talbot Department of Mathematics University College
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 informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 6 and Derrick Stolee 7 Abstract Given k
More informationPacking triangles in regular tournaments
Packing triangles in regular tournaments Raphael Yuster Abstract We prove that a regular tournament with n vertices has more than n2 11.5 (1 o(1)) pairwise arc-disjoint directed triangles. On the other
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 informationOn set systems with a threshold property
On set systems with a threshold property Zoltán Füredi 1 Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA, and Rényi Institute of Mathematics of the Hungarian
More informationApproximation algorithms for cycle packing problems
Approximation algorithms for cycle packing problems Michael Krivelevich Zeev Nutov Raphael Yuster Abstract The cycle packing number ν c (G) of a graph G is the maximum number of pairwise edgedisjoint cycles
More informationarxiv: v2 [math.co] 24 Sep 2014
Logarithmically-small Minors and Topological Minors Richard Montgomery September 26, 2018 arxiv:1309.7886v2 [math.co] 24 Sep 2014 Abstract For every integer t there is a smallest real number c(t) such
More information