Jacques Verstraëte
|
|
- Joseph McBride
- 6 years ago
- Views:
Transcription
1 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 Theorem [7], Simonovits Theorem on color-critical graphs [14] and the stability method, and the Andrásfai- Erdős-Sós Theorem. In the following material, we use the notion of an independent set of a graph G: this is a set of I vertices of G such that no two vertices of I are adjacent in G. These are sometimes referred to as stable sets in the literature. The chromatic number of a graph G, denoted χ(g), is the smallest r such that V (G) has a partition into independent sets V 1, V 2,..., V r. In other words, we may assign r colors to the vertices of G in such a way that no two vertices of the same color r adjacent. Such graphs are also called r-partite. The graph G is a complete r-partite graph if all edges between V i and V j are present for i, j : 1 i < j r. We say G is a balanced r-partite graph if V 1 V 2 V r V If X, Y are sets of vertices in a graph, let e(x, Y ) denote the number of edges {x, y} with x X and y Y, and e(x) = e(x, X). If f, g : N R + R + are functions, we write f = O δ (g) if there exists a constant c(δ) depending only on δ such that f(n, δ) c(δ)g(n, δ) for all n N and for all δ R +. Similarly f = Ω δ (g) if and only if g = O δ (f), and f = Θ δ (g) if f = O δ (g) and g = O δ (f). If f = Θ(g), we say that f and g have the same order of magnitude. We write ex(n, F) instead of ex 2 (n, F) when F is a family of graphs. 1
2 1.1 Mantel s Theorem The first theorem of extremal graph theory is Mantel s Theorem [12], which shows that the extremal triangle-free graphs are balanced complete bipartite graphs. There are many proofs of this result; we give the inductive proof (by deleting vertices). Theorem 1. [12] If G is a triangle-free n-vertex graph, then e(g) n 2 /4, with equality if and only if G is a balanced complete bipartite graph. Proof. We proceed by induction on n. The theorem is trivial if n = 1, 2. For n 3, let G be a triangle-free n-vertex graph, and suppose e(g) n 2 /4. We claim G is a balanced complete bipartite graph. Since adding any edge to a balanced complete bipartite graph gives a triangle, it is sufficient to prove the theorem for any graph G with e(g ) = n 2 /4 obtained by deleting edges of G. By Proposition 1, G contains a vertex v with d G (v) n/2, since (n/2)( n/2 + 1) > n 2 /4 for all n 1. Let G = G {v}. Then n e(g 2 n ) = 4 2 (n 1) 2 By induction, G is a balanced complete bipartite graph with parts say X 0 and X 1, and e(g ) = (n 1) 2 /4. This also implies d G (v) = n/2. Now for some i {0, 1}, N G (v) X i =, otherwise G contains a triangle containing v. Therefore N G (v) X 2 i. However then X 2 i N G (v) n/2, and so X i n/2. We conclude G is bipartite, with parts X i {v} and X 2 i. Furthermore, e(g ) = n 2 /4 and e(g ) X 1 X 2 implies X 1 n/2 and X 2 n/2, so G is balanced. 4. In the language of Turán Numbers, this theorem says ex(n, K 3 ) = n 2 /4 and π(k 3 ) = Turán s Theorem The proof of Mantel s Theorem generalizes to give Turán Numbers for complete graphs. This was proved by Turán [17]. We define the Turán Graphs to be n- vertex graphs T r (n) which admit a vertex partition V 1 V 2 V r such that V 1 V 2 V r V such that T r (n) contains all edges between V i and V j, for 1 i < j r and no edges in any V i. We call this the r-partition of T r (n), 2
3 and T r (n) is the balanced complete r-partite graph. Then e(t r (n)) = n + i n + j. r r 0 i<j<r In the special case r = 2, we get the balanced complete bipartite graph. Some simple observations on T r (n) are that T r (n 1) is obtained from T r (n) by deleting a vertex of T r (n) of lowest degree, namely a vertex of degree δ(t r (n)) = n/r. In fact, T r (n) is the n-vertex graph with highest minimum degree amongst all n-vertex graphs with e(t r (n)) edges. Also, amongst all r-partite n-vertex graphs, T r (n) has the maximum number of edges, and if G is an r-partite n-vertex graph with e(g) = e(t r (n)), then G = T r (n). Note also that e(t r (n)) (1 1 r )( n 2). Here is Turán s Theorem: Theorem 2. [17] Let G be a K r+1 -free n-vertex graph. Then e(g) e(t r (n)) with equality if and only if G = T r (n). Proof. Proceed by induction on n. The cases n r follow from the fact that e(t r (n)) = e(k n ) for n r. For n r + 1, let G be an n-vertex K r+1 -free graph with e(g) e(t r (n)). We may assume e(g) = e(t r (n)) by deleting edges and noting T r (n) is a maximal K r+1 -free graph. Since T r (n) is the graph with e(t r (n)) edges of highest minimum degree, δ(g) δ(t r (n)). Removing a vertex v of degree δ(g) from G, we get a graph G with e(g ) e(t r (n)) δ(t r (n)) = e(t r (n 1)). It follows that G = T r (n 1). If V 1 V 2 V r is the r-partition of T r (n 1), and v is adjacent to at least one vertex v i V i for all i r, then {v, v 1, v 2,..., v r } is the vertex set of K r+1 in G, a contradiction. Therefore some V i contains no neighbors of v. Then the V j : j i together with V i {v} form an r-partition of G, so G = T r (n). This theorem shows π(k r ) = 1 1 r 1 for r 2. We will show how to adapt the proof above to determining π(f) for every family F of graphs. 2 The Erdős-Stone Theorem To determine π(f) for every family F of graphs, we use the key fact that T r (n) contains every graph F with χ(f ) r and V (F ) n, and contains no graph F with χ(f ) > r. Let χ(f) = min{χ(f ) : F F}. The following result is referred to as the Erdős-Stone Theorem [7]: 3
4 Theorem 3. [7] For every r, m 1, π(t r (m)) = 1 1 r 1 = π(k r). In particular, for any family F of graphs with χ(f) 2, π(f) = 1 1 χ(f) 1. Proof. Let ε > 0 and let G be an n-vertex graph with density π(k r ) + ε. By the supersaturation lemma and Turán s Theorem, G contains at least δn r copies of K r for some δ > 0 depending only on ε. Let H be the hypergraph with V (H) = V (G) and E(H) = {V (K r ) : K r G}. Then H is an r-graph with at least δn r edges. By Theorem 14, with t = m/r, H contains K t:r provided n is large enough, and this implies T r (m) G. Therefore π(k r ) π(t r (m)) π(k r ) + ε for any ε > 0, and so π(t r (m)) = π(k r ). The second part of the theorem was observed by Simonovits: if F F has χ(f ) = r = χ(f), then F T r (m) where m r V (F ). This shows π(f) π(t r (m)). Since π(f) π(k r ), we are done. This theorem shows that the Turán densities for graphs lie in the set {0, 1 2, 2 3, 3 4,... }. 2.1 Improvements on Erdős-Stone It is useful to ask for quantitative bounds in the Erdős-Stone Theorem. Specifically, for r 2 and > 0, let f r (n, ) = max{m N : ex(n, T r (rm)) ex(n, K r ) n2 1}. The original proof of the Erdős-Stone Theorem [7] gives where the iterated logarithm is r times. f r (n, ) = Ω,r ( log log log... log n), This turns out to be very far from the truth, and gives very poor bounds on the speed of the convergence of ex(n, F) to π(k r ) when χ(f) = r. We now briefly outline historical improvement, and later we will show how to determine f r (n, ) quite accurately. For r = 2, the Kövari-Sós-Turán Theorem (see Lecture Notes 1) shows for all n, ex(n, T 2 (2m)) = ex(n, K m,m ) 1 2 (m 1)1/m n 2 1/m + 1 (m 1)n. 2 4
5 From this the reader can gather via asymptotic calculations that for any > 0, f 2 (n, ) log 1 n. We shall shortly see that this is asymptotically best possible up to a factor two, as proved by Bollobás and Erdős [3, 4]. It turns out to be very difficult to give explicit constructions of graphs which show f r (n, ) is small. For the first time in our work, we appeal to random graphs for the following strong theorem of Bollobás and Erdős [3, 4], which determines f 2 (n, ) up to an asymptotic factor of two. Theorem 4. [3] For each r 1 and 0 < < 1/r 2, f r+1 (n, ) 2 log 1 r 2 n. In particular, if = o(1) then f r (n, ) 2 log 1 n for all r 2. Proof. Let T be the Turán graph T r (n). If we add a K t,t -free graph H in some part of T r (n), then we obtain a graph G that does not contain T r+1 ((r + 1)t) and has e(t r (n)) + e(h) = ex(n, K r ) + e(h) edges. If we can ensure e(h) 1 2 n2 1, then f r+1 (n, ) t. Taking V (H) = n/r, we would like H to be a K t,t -free graph with e(h) 1 2 n2 1, in other words, t f 2 ( n/r, r 2 ). This certainly shows for all r 2 that f r+1 (n, ) f 2 ( n/r, r 2 ) provided < 1/r 2. Now we show f 2 (n, ) 2 log 1 n. To do this, we construct a random graph G on n vertices, where each edge is present independently with probability. Then E(e(G)) = ( n 2). Let Y be the number of Kt,t G where t = 2 log 1 n. Then ( ) n E(Y ) = t2 2 t 1 < ( t n 2 ) t. 2t The definition of t ensures t n 2 < 1 and therefore E(Y ) < 1. Let G be obtained from G by deleting one edge from every copy of K t,t G. Then we obtain a graph G such that E(G ) E(e(G) Y ) > ( ) n 1. 2 Then G is a K t,t -free graph with more than ( n 2) 1 edges, so f2 (n, ) 2 log 1 n. We conclude for < 1/r 2 that This completes the proof. f r+1 (n, ) f 2 ( n/r, r 2 ) 2 log 1 r 2 n. 5
6 Bollobás and Erdős [3, 4] determined the order of magnitude of f r (n, ) for all r 2, namely f r (n, ) = Θ r, (log n). Chvátal and Szemerédi [6] determined the dependence on of the implicit constant to be 1/ log(1/), and finally, Ishigami [9] determined the asymptotic behavior of f r (n, ) for all r 3 conditional on the asymptotic behavior of f 2 (n, ): Theorem 5. Let r 2 and let (n) = = o(1) as n. Then f r (n, ) f 2 (n, ) and, in particular, log 1 n f r (n, ) 2 log 1 n. The proof of Theorem 5 in [9] uses Szemerédi s Regularity Lemma and is rather technical. 3 The stability method We next turn to situations where extremal numbers can be determined exactly. The idea is to use the stability method, which in rough terms says that we first determine the approximate structure of near extremal graphs, and then use this approximate structure to obtain exact structure of exactly extremal graphs. A key lemma in the stability approach is as follows: Lemma 6. Let F be a graph. Suppose that for all n n 0, if G n is an extremal n-vertex F -free graph, then e(g n 1 ) = e(g n ) δ(g n ), and if H n is an n-vertex F -free graph with δ(h n ) δ(g n ) and e(h n ) e(g n ), then H n = G n. Then for n n 2 0, if J is any n-vertex graph with e(j n) e(g n ), then J = G n. Proof. If δ(j n ) δ(g n ), then we are done. Suppose δ(j n ) < δ(g n ). Remove from J n a vertex of smallest degree to obtain a graph J n 1. If δ(j n 1 ) < δ(g n 1 ), repeat. Continue until δ(j m ) δ(g m ) or m = n 0 1. If m n 0, then δ(j m ) δ(g m ) and e(j m ) e(g m ) implies J m = G m by assumption. Otherwise, m = n 0 and ( ) m e(j m ) e(g m ) + n m > m 2 m >. 2 This is a contradiction. 6
7 3.1 Color-critical graphs A good example of the application of the stability method is to color-critical graphs. We refer to a graph F as r-color critical if χ(f {e}) < χ(f ) = r for some e E(F ). For instance, complete graphs and odd cycles are color critical. Our aim is to show that if F is (r + 1)-color-critical, then ex(n, F ) = e(t r (n)) with equality only for T r (n). The following embedding lemma is required. An n-vertex r-partite graph G with parts Z 1, Z 2,..., Z r is almost complete if for every i r and j r with j i, every vertex z Z i has N G (z) Z j Z j. Lemma 7. Let F be a color-critical graph with χ(f ) = r+1, and let G be an almost complete r-partite graph with parts Z 1, Z 2,..., Z r. Then (i) (ii) If G is F -free, then the sets Z i are independent sets. If we add a vertex w to G and get an F -free graph, then w has at most V (F ) neighbors in some Z i. The proof of this lemma is straightforward. We now turn to the proof of the Simonovits Theorem [14] for color-critical graphs: Theorem 8. [14] Let r 2, and let F be an (r + 1)-color-critical graph. Then the unique extremal n-vertex F -free graphs are T r (n), provided n is large enough. Proof. Let G be an n-vertex F -free graph with at least e(t r (n)) edges and b = V (F ). Let V (G) = V. By Lemma 6, we may assume δ(g) δ(t r (n)) n n/r. By the Erdős-Stone Theorem, T r (rt) G where t = ω(1). Let V 1, V 2,..., V r be the parts of this T r (rt). By Lemma 7(i), each V i is an independent set. For each vertex w V, there exists a least i r such that w has less than b neighbors in V i, by Lemma 7(ii). We add w to V i in this case. Repeating this for every vertex w V, we obtain a partition W 1 W 2 W r of V with W i V i for all i r, and such that every vertex of W i has less than b neighbors in V i. Then since δ(g) n n/r, e(v i, V \V i ) (n n/r )t. On the other hand, e(v i, V \V i ) < b W i + e(w j, V i ) b W i + t W j. j i j i 7
8 Combining the last two inequalities, we have for every i r the inequality Since b = o(t), this implies W j + b t W i n n/r. j i W j n n/r. Since r i=1 W i = n, these inequalities imply W i n/r. Then e(w j, V i ) (n n/r)t. j i j i Since e(w j, V i ) tn/r for all i, j r, we conclude e(w j, V i ) tn/r W j V i for all i j and all j r. Let X i W i consists of all vertices w W i such that N j (w) V j t for all j i, noting V i X i. Since e(w i, V j ) W i V j for every j i, X i W i. Now the r- partite subgraph of G with parts X i and V j : j i is almost complete, so by Lemma 7(i), X i is an independent set. This holds for each i r, so every X i is independent. Let X = r i=1 X i and C = V \X. Then C = o(n) since X i W i n/r for i r. This implies that W = V \ X i has size o(n). Now if w W i \X i, then N G (w) X i < b. Therefore N G (w) j i X i > n n/r b W n n/r. We add w to X i in this case. Repeating this for every w W, we obtain a partition Y 1 Y 2 Y r of V, such that the Y i are the parts of an almost complete r-partite graph. By Lemma 7(i), each Y i is an independent set, and so G is r-partite. Since e(g) e(t r (n)), it follows G = T r (n). 3.2 Decomposition families If F is not color-critical, then the situation changes. The decomposition family of a graph F of chromatic number r,denoted M(F ), is the set of bipartite graphs obtained by deleting any set of r 2 color classes of F in any proper r-coloring of F. Then we can add ex(n, M(F )) edges into any part of T r 1 (n) and still not get a copy of F. For instance, if we take the graph F consisting of two triangles sharing one 8
9 vertex, then M(F ) consists of a pair of disjoint edges and a pair of edges sharing one vertex. Since ex(n, F) = 1 for all n 2, we deduce that ex(n, F ) n 2 /4 +1 and we can add one edge in any part of T 2 (n) to get an F -free construction. It is an exercise to show that this is tight for this particular graph F. In general, however, the family F will contain bipartite graphs and this leads us to return to the Degenerate Turán Problems. Simonovits [15] has shown that in fact the extremal F -free graphs in general when r + 1 = χ(f ) 3 are T r (n) plus some extremal F-free graphs pasted into the parts of T r (n). As another instance, if F is the Petersen graph, then the extremal graph (see Figure 1) was determined by Simonovits: take K m,n m where m = n/2 1 and add the complement of K n m 2 in the part of size n m. A survey of decomposition families is given in Simonovits survey paper [15]. Figure 1: The Petersen Graph 4 Andrásfai-Erdős-Sós Theorem In the last sections, we saw that an n-vertex graph with e(t r (n)) edges and no K r is r-colorable. It is not true, however, that all K r -free graphs are r-colorable. Let us examine the case r = 3. The first constructions of triangle-free graphs with arbitrarily high chromatic number were given by Zykov [18] and Mycielski [13]. A well-known construction comes from Kneser graphs. Consider the Kneser graphs K n t. Recall, for a set V with V = n, V (K n t ) = ( ) V t and E(K n t ) = {{S, T } : S, T ( V t ), S T = }. The Petersen graph shown in Figure 1 is isomorphic to K
10 A breakthrough theorem of Lovász [10] shows χ(k n t ) = n 2t + 2. If we take n = 3t 1, then K n t is a triangle-free graph with chromatic number t + 1. In other words, we have triangle-free graphs of arbitrarily large chromatic number. Hajnal showed how to add a large bipartite graph to K n t without creating triangles, whilst increasing the minimum degree to 1/3 o(1) of the number of vertices. The construction of triangle-free graphs of large chromatic number has received considerable attention, and we shall revisit this problem in the context of Ramsey Theory. Mantel s Theorem says that an n-vertex triangle-free graph with minimum degree at least n/2 is bipartite. The following theorem due, to Andrásfai, Erdős and Sós [2], gives the threshold minimum degree for a triangle-free graph to be bipartite. Theorem 9. [2] Let n 1. Then any n-vertex triangle-free graph of minimum degree larger than 2n/5 is bipartite. Furthermore, there exists for every n 5 a triangle-free non-bipartite graph of minimum degree 2n/5. Proof. Let G be such a graph. Suppose, for a contradiction, that G is not bipartite. Then there is a shortest odd cycle C G. This cycle C is an induced cycle in G, and if u, v V (C) have distance more than two on C, then N G (u) N G (v) =, since C is shortest. Since G is triangle-free, the same is true if u and v are adjacent on C. If C has length at least seven, then pick a vertex w and adjacent vertices u, v at distance at least three from w on C. Then N G (u), N G (v), N G (w) are disjoint, so N G (u) + N G (v) + N G (w) n. However N G (u) > 2n/5 and the same for v and w, so this is a contradiction. Therefore C has length exactly five. Suppose this cycle has vertices v 0, v 1, v 2, v 3, v 4 in that order on the cycle. Then with subscripts mod five,n G (v i ) N G (v i+1 ) =, which implies N G (v i 1 ) contains more than n/5 vertices in N G (v i+1 ) for all i {0, 1, 2, 3, 4}. If W i = N G (v i ) N G (v i+2 ) for i {0, 1, 2, 3, 4}, then the W i are pairwise disjoint sets of size more than n/5, a contradiction. For the construction for n 5, take a blowup of a cycle of length five (see Figure 2). In other words, let G be the graph with five parts V 0, V 1, V 2, V 3, V 4 where V 0 V 1 V 2 V 3 V 4 V 0 +1 and where V i and V i+1 are the parts of a complete bipartite subgraph of G for all i with subscripts mod five. Then G is triangle-free, and not bipartite. 10
11 Figure 2: The Blowup of a Pentagon 4.1 Chromatic threshold Brandt and Thomassé [5] showed that any n-vertex triangle-free graph of minimum degree more than n/3 is 4-colorable, whereas the afore-mentioned construction of Hajnal shows that there are n-vertex graphs G with δ(g) n/3 such that χ(g) = ω(1). The chromatic threshold of a graph H is the infimum of those δ [0, 1] such that every n-vertex H-free graph of minimum degree at least δn has bounded chromatic number. Thomassen [16] was the first to show that the chromatic threshold of K 3 is 1 3 confirmed in a strong sense in [5]. The chromatic threshold for K r for r 3 was determined to be (2r 5)/(2r 3) by Goddard and Lyle [8]. A novel approach to the chromatic threshold problem was given by Luczak and Thomassé [11] in terms of the VC-dimension of hypergraphs. The problem was completely solved by Allen, Böttcher, Kohayakawa and Morris [1] in the form of the following theorem. A graph H with χ(h) = r is r-near-acyclic if we can delete r 3 color classes from H to obtain a graph H such that V (H ) = X Y and X is an independent set and all edges of H in Y are disjoint. Theorem 10. [1] Let H be any graph with χ(h) = r 3. Then the chromatic threshold of H is an element of The chromatic threshold is not r 2 r 1 { r 3 r 2, 2r 5 2r 3, r 2 r 1 }. if and only if H is r-near- contains a forest, and the chromatic threshold is r 3 r 2 acyclic. if and only if the decomposition family M(H) 11
12 For instance, this theorem shows that odd cycles, the Petersen graph and the docecahedron graph (see Figure 3) have chromatic threshold zero, whereas the chromatic threshold of the icosahedron graph is 3/5. The proof of Theorem 10 is beyond the scope of this course, and makes very technical use of Szemerédi s Regularity Lemma. Figure 3: Dodecahedron Graph References [1] P. Allen, J. Bóttcher, S. Griffiths, and Y. Kohayakawa, The chromatic threshold of graphs Advances in Mathematics, 235 (2013) [2] B. Andrásfai, P. Erdős, and V. T. Sós, On the connection between chromatic number, maximal clique and minimal degree of a graph, Discrete Math. 8 (1974), [3] B. Bollobás and P. Erdős, On the structure of edge graphs, Bull. London Math. Soc. 5 (1973), [4] B. Bollobás, P. Erdős, and M. Simonovits, On the structure of edge graphs, II, J. London Math. Soc. (2) 12 (1976), [5] S. Brandt and S. Thomassé, Dense triangle-free graphs are four colorable: A solution to the Erdős-Simonovits problem. With S. Brandt, to appear. [6] V. Chvátal and E. Szemerédi, Notes on the ErdősStone Theorem, Ann. Discrete Math. 17 (1983),
13 [7] P. Erdős and A. H. Stone, On the structure of linear graphs, Bulletin of the American Mathematical Society 52 (1946), [8] W. Goddard and J. Lyle, Dense graphs with small clique number, Journal of Graph Theory 66 (2011), no. 4, [9] Y. Ishigami, Proof of a conjecture of Bollobas and Kohayakawa on the Erd?os- Stone theorem, J. Combin. Theory Ser. B (2) 85 (2002), [10] L. Lovász, Knesers conjecture, chromatic number, and homotopy, J. Combin. Theory Ser. A, 25 (1978), [11] T. Luczak and S. Thomassé, Coloring dense graphs via VC-dimension arxiv: v1. [12] W. Mantel, Problem 28, Wiskundige Opgaven 10 (1907), [13] J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955), [14] M. Simonovits, A method for solving extremal problems in graph theory, stability problems, 1968 Theory of Graphs (Proc. Colloq., Tihany, 1966) pp Academic Press, New York [15] M. Simonovits, How to solve a Turán type extremal graph problem? (linear decomposition). Contemporary trends in discrete mathematics (Stirn Castle, 1997), , DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49, Amer. Math. Soc., Providence, RI, [16] C. Thomassen, On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree, Combinatorica, 22 (2002), [17] P. Turán, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941), [In Hungarian]; On the theory of graphs, Coll. Math. 3 (1954), pp ; 13 (1965), [18] A. Zykov, On some properties of linear complexes (in Russian), Math. Sbornik., 24 (1949),
The 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 informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More 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 informationAN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS. 1. Introduction We study edge decompositions of a graph G into disjoint copies of
AN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS PETER ALLEN*, JULIA BÖTTCHER*, AND YURY PERSON Abstract. We consider partitions of the edge set of a graph G into copies of a fixed graph H
More informationOn the Chromatic Thresholds of Hypergraphs
On the Chromatic Thresholds of Hypergraphs József Balogh Jane Butterfield Ping Hu John Lenz Dhruv Mubayi October 5, 013 Abstract Let F be a family of r-uniform hypergraphs. The chromatic threshold of F
More informationOn the Chromatic Thresholds of Hypergraphs
On the Chromatic Thresholds of Hypergraphs József Balogh Jane Butterfield Ping Hu John Lenz Dhruv Mubayi September 14, 2011 Abstract Let F be a family of r-uniform hypergraphs. The chromatic threshold
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 informationarxiv: v3 [math.co] 25 Feb 2019
Extremal Theta-free planar graphs arxiv:111.01614v3 [math.co] 25 Feb 2019 Yongxin Lan and Yongtang Shi Center for Combinatorics and LPMC Nankai University, Tianjin 30001, China and Zi-Xia Song Department
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 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 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 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 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 informationGRAPH EMBEDDING LECTURE NOTE
GRAPH EMBEDDING LECTURE NOTE JAEHOON KIM Abstract. In this lecture, we aim to learn several techniques to find sufficient conditions on a dense graph G to contain a sparse graph H as a subgraph. In particular,
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 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 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 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 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 informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationStrong Turán stability
Available online at www.sciencedirect.com www.elsevier.com/locate/endm Strong Turán stability Mykhaylo Tyomkyn 1,2 School of Mathematics University of Birmingham Birmingham B15 2TT, United Kingdom Andrew
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More 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 informationCutwidth and degeneracy of graphs
Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1
More informationThe Rainbow Turán Problem for Even Cycles
The Rainbow Turán Problem for Even Cycles Shagnik Das University of California, Los Angeles Aug 20, 2012 Joint work with Choongbum Lee and Benny Sudakov Plan 1 Historical Background Turán Problems Colouring
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 informationThe structure of bull-free graphs I three-edge-paths with centers and anticenters
The structure of bull-free graphs I three-edge-paths with centers and anticenters Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised March 29, 2011 Abstract The bull is the
More informationA generalized Turán problem in random graphs
A generalized Turán problem in random graphs Wojciech Samotij Clara Shikhelman June 18, 2018 Abstract We study the following generalization of the Turán problem in sparse random graphs Given graphs T and
More informationOn subgraphs of large girth
1/34 On subgraphs of large girth In Honor of the 50th Birthday of Thomas Vojtěch Rödl rodl@mathcs.emory.edu joint work with Domingos Dellamonica May, 2012 2/34 3/34 4/34 5/34 6/34 7/34 ARRANGEABILITY AND
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 informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
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 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 informationAnti-Ramsey Numbers of Doubly Edge-Critical Graphs
Anti-Ramsey Numbers of Doubly Edge-Critical Graphs Tao Jiang 1 andolegpikhurko 2 1 DEPARTMENT OF MATHEMATICS AND STATISTICS MIAMI UNIVERSITY OXFORD, OH 45056 E-mail: jiangt@muohio.edu 2 DEPARTMENT OF MATHEMATICAL
More informationTHE TYPICAL STRUCTURE OF GRAPHS WITH NO LARGE CLIQUES
THE TYPICAL STRUCTURE OF GRAPHS WITH NO LARGE CLIQUES JÓZSEF BALOGH, NEAL BUSHAW, MAURÍCIO COLLARES NETO, HONG LIU, ROBERT MORRIS, AND MARYAM SHARIFZADEH Abstract. In 1987, Kolaitis, Prömel and Rothschild
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationOn 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 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 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 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 informationTurán s problem and Ramsey numbers for trees. Zhi-Hong Sun 1, Lin-Lin Wang 2 and Yi-Li Wu 3
Colloquium Mathematicum 139(015, no, 73-98 Turán s problem and Ramsey numbers for trees Zhi-Hong Sun 1, Lin-Lin Wang and Yi-Li Wu 3 1 School of Mathematical Sciences, Huaiyin Normal University, Huaian,
More informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationThe Zarankiewicz problem in 3-partite graphs
The Zarankiewicz problem in 3-partite graphs Michael Tait Carnegie Mellon University mtait@cmu.edu AMS Eastern Fall Sectional University of Delaware September 29, 2018 Michael Tait (CMU) September 29,
More informationOn the Turán number of Triple-Systems
On the Turán number of Triple-Systems Dhruv Mubayi Vojtĕch Rödl June 11, 005 Abstract For a family of r-graphs F, the Turán number ex(n, F is the maximum number of edges in an n vertex r-graph that does
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 informationTHE ASYMPTOTIC NUMBER OF TRIPLE SYSTEMS NOT CONTAINING A FIXED ONE
THE ASYMPTOTIC NUMBER OF TRIPLE SYSTEMS NOT CONTAINING A FIXED ONE BRENDAN NAGLE AND VOJTĚCH RÖDL Abstract. For a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph
More informationTHE CRITICAL NUMBER OF DENSE TRIANGLE-FREE BINARY MATROIDS
THE CRITICAL NUMBER OF DENSE TRIANGLE-FREE BINARY MATROIDS JIM GEELEN AND PETER NELSON Abstract. We show that, for each real number ε > 0 there is an integer c such that, if M is a simple triangle-free
More informationA taste of perfect graphs
A taste of perfect graphs Remark Determining the chromatic number of a graph is a hard problem, in general, and it is even hard to get good lower bounds on χ(g). An obvious lower bound we have seen before
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
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 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 informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
More informationOn 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 informationCycles in triangle-free graphs of large chromatic number
Cycles in triangle-free graphs of large chromatic number Alexandr Kostochka Benny Sudakov Jacques Verstraëte Abstract More than twenty years ago Erdős conjectured [4] that a triangle-free graph G of chromatic
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 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 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 informationarxiv: v1 [math.co] 21 Sep 2017
Chromatic number, Clique number, and Lovász s bound: In a comparison Hamid Reza Daneshpajouh a,1 a School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran, P.O. Box 19395-5746
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 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 informationON THE RATIONAL TURÁN EXPONENTS CONJECTURE
ON THE RATIONAL TURÁN EXPONENTS CONJECTURE DONG YEAP KANG, JAEHOON KIM, AND HONG LIU Abstract. The extremal number ex(n, F ) of a graph F is the maximum number of edges in an n-vertex graph not containing
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More 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 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 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 informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationInduced subgraphs of graphs with large chromatic number. I. Odd holes
Induced subgraphs of graphs with large chromatic number. I. Odd holes Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544,
More informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
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 typical structure of graphs without given excluded subgraphs + related results
The typical structure of graphs without given excluded subgraphs + related results Noga Alon József Balogh Béla Bollobás Jane Butterfield Robert Morris Dhruv Mubayi Wojciech Samotij Miklós Simonovits.
More informationHypergraph Turán Problems (IPAM Tutorial)
(IPAM Tutorial) Peter Keevash School of Mathematical Sciences, Queen Mary, University of London. p.keevash@qmul.ac.uk Introduction: From graphs to hypergraphs Mantel s Theorem (1907) The largest graph
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 informationSaturation numbers for Ramsey-minimal graphs
Saturation numbers for Ramsey-minimal graphs Martin Rolek and Zi-Xia Song Department of Mathematics University of Central Florida Orlando, FL 3816 August 17, 017 Abstract Given graphs H 1,..., H t, a graph
More informationDestroying non-complete regular components in graph partitions
Destroying non-complete regular components in graph partitions Landon Rabern landon.rabern@gmail.com June 27, 2011 Abstract We prove that if G is a graph and r 1,..., r k Z 0 such that k i=1 r i (G) +
More informationCounting substructures II: hypergraphs
Counting substructures II: hypergraphs Dhruv Mubayi December, 01 Abstract For various k-uniform hypergraphs F, we give tight lower bounds on the number of copies of F in a k-uniform hypergraph with a prescribed
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
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 informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More 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 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 informationPerfect divisibility and 2-divisibility
Perfect divisibility and 2-divisibility Maria Chudnovsky Princeton University, Princeton, NJ 08544, USA Vaidy Sivaraman Binghamton University, Binghamton, NY 13902, USA April 20, 2017 Abstract A graph
More informationProceedings of the 2014 Federated Conference on Computer Science and Information Systems pp
Proceedings of the 204 Federated Conference on Computer Science Information Systems pp. 479 486 DOI: 0.5439/204F297 ACSIS, Vol. 2 An efficient algorithm for the density Turán problem of some unicyclic
More informationTHE STRUCTURE OF ALMOST ALL GRAPHS IN A HEREDITARY PROPERTY
THE STRUCTURE OF ALMOST ALL GRAPHS IN A HEREDITARY PROPERTY NOGA ALON, JÓZSEF BALOGH, BÉLA BOLLOBÁS, AND ROBERT MORRIS Abstract. A hereditary property of graphs is a collection of graphs which is closed
More informationPart III Extremal Graph Theory
Part III Extremal Graph Theory Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 017 These notes are not endorsed by the lecturers, and I have modified them often significantly)
More informationOn two problems in Ramsey-Turán theory
On two problems in Ramsey-Turán theory József Balogh Hong Liu Maryam Sharifzadeh July 7, 016 Abstract Alon, Balogh, Keevash and Sudakov proved that the (k 1)-partite Turán graph maximizes the number of
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 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 informationOn the chromatic number of the lexicographic product and the Cartesian sum of graphs
On the chromatic number of the lexicographic product and the Cartesian sum of graphs Niko Čižek University of Maribor TF, Smetanova ulica 17 62000 Maribor, Slovenia Sandi Klavžar University of Maribor
More informationInduced Turán numbers
Induced Turán numbers Po-Shen Loh Michael Tait Craig Timmons Abstract The classical Kővári-Sós-Turán theorem states that if G is an n-vertex graph with no copy of K s,t as a subgraph, then the number of
More informationGRAPHS WITHOUT THETA SUBGRAPHS. 1. Introduction
GRAPHS WITHOUT THETA SUBGRAPHS J. VERSTRAETE AND J. WILLIFORD Abstract. In this paper we give a lower bound on the greatest number of edges of any n vertex graph that contains no three distinct paths of
More informationImproved Bounds for the Chromatic Number of the Lexicographic Product of Graphs
Improved Bounds for the Chromatic Number of the Lexicographic Product of Graphs Roland Kaschek University of Klagenfurt Department of Computer Science 9020 Klagenfurt, Austria Sandi Klavžar University
More informationProof of the (n/2 n/2 n/2) Conjecture for large n
Proof of the (n/2 n/2 n/2) Conjecture for large n Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303 September 9, 2009 Abstract A conjecture of Loebl, also known
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 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 informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
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 information