On judicious bipartitions of graphs
|
|
- Job Russell
- 5 years ago
- Views:
Transcription
1 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 let gm be the minimum value s such that for any graph G with m edges there exists a bipartition V G = V 1 V such that G has at most s edges with both incident vertices in V i. Alon proved that the limsup of fm m/ + m/8 tends to infinity as m tends to infinity, establishing a conjecture of Erdős. Bollobás and Scott proposed the following judicious version of Erdős conjecture: the limsup of m/4 + m/3 gm tends to infinity as m tends to infinity. In this paper, we confirm this conjecture. Moreover, we extend this conjecture to -partitions for all even integers. On the other hand, we generalize Alon s result to multi-partitions, which should be useful for generalizing the above Bollobás-Scott conjecture to -partitions for odd integers. School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 3006, China. School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia , USA. Partially supported by NSF grants DMS and AST and NSA grant H
2 1 Introduction Let G be a graph and e EG. We will use V e to denote the set of the vertices of G incident with e. Let S, T V G. We write e G S := {e EG : V e S}, S, T G := {e EG : V e S = V e T }, and e G S, T := S, T G. If S = {v}, then we simply write e G v, T for e G {v}, T. For any integer and any -partition V 1, V,..., V of V G, let e G V 1, V,..., V = 1 i<j ev i, V j. When understood, the reference to G in the subscript will be dropped. Again let G be a graph. We write eg := EG. For any integer, let f G denote the maximum number of edges in a -partite subgraph of G. For any integers and m 1, let f m := min{f G : eg = m}. Let fg := f G and fm := f m. The problem for deciding fg, nown as the Max Cut Problem, is NP-hard, and there has been extensive wor on approximating fg, see [4, 14 16, 19]. On the other hand, it is easy to prove that any graph with m edges has a partition V 1, V with ev 1, V m/. Edwards [11, 1] improved this lower bound by showing fm m + 1 m 1 + 1/4 = m/ + m/8 + O1. 4 This is best possible, as K n+1 are extremal graphs. Erdős [13] conjectured that the limsup of fm m/ + m/8 tends to infinity as m tends to infinity. Alon [1] confirmed this conjecture with the following Theorem 1.1 Alon There exist absolute constants c > 0 and M > 0 such that for every even integer n > M, if m = n / then fm m/ + m/8 + cm 1/4. When m is sufficiently large, the function fm was determined exactly in a recursive formula by Alon and Halperin [3] and Bollobás and Scott [7] independently. Bollobás and Scott [5] considered problems in which one needs to find a partition of a given graph or hypergraph to optimize several quantities simultaneously. Such problems are called judicious partitioning problems, and we refer the reader to [7 9, 17] for more problems and references. Let G be a graph and a positive integer; we use g G to denote the minimal number t such that there exists a -partition V G = V 1... V satisfying ev i t for i = 1,...,. For any positive integers and m, let g m := max{g G : eg = m}. Let gg := g G and gm := g m. The problem of determining gg is nown as the Bottlenec Graph Bipartition Problem and is also NP-hard. The NP-hardness of determining gg can be derived from the NPhardness of Max Cut: taing a graph G consisting of two disjoint copies of graph H, then one can see that gg = eh fh. On the other hand, Bollobás and Scott [6] showed that for any positive integer m gm m m + 1/4 1/ = m/4 + m/3 + O1.
3 This bound is sharp, as K n+1 are extremal graphs. In fact, the result they proved is stronger, which states that this bound as well as the Edwards bound can be achieved simultaneously by some bipartite in every graph with m edges. Bollobás and Scott [7] also see [17] proposed the following judicious version of Erdős conjecture. Conjecture 1. Bollobás and Scott The limsup of tends to infinity as m tends to infinity. m/4 + m/3 gm The main goal of this paper is to prove the coming result which confirms Conjecture 1.. Theorem 1.3 There exist absolute constants d > 0 and N > 0 such that for every even integer n > N, if m = n / then gm m/4 + m/3 dm 1/4. We describe the main ideas of the proofs as follows. To establish an upper bound of gm, i.e., to find a bipartition such that each of its two parts contains a small number of edges, we start with a maximum cut, say V 1, V. In light of Theorem 1.1, this already guarantees that ev 1 + ev is relatively small. We then modify the bipartition by moving some vertices from the part with more edges say V 1 to the other part until V 1 has a small enough number of edges left, and eeping the number of edges in V not growing too much. Therefore, at each step we wish to choose a vertex in V 1 to move such that the number of edges lost in V 1 and the number of new edges added in V both are under control. To prove the existence of such a vertex say a good one, we show that there cannot be too many bad vertices. Similar approaches have been employed in [, 6, 10], while the challenges for us are to find suitable measures of goodness in all different cases, which are classified by the size of the maximum cut. Bollobás and Scott [8] also see [7] extended Edwards bound to -partitions of graphs and proved that for any graph G with m edges has a -partition V 1,..., V such that ev 1,..., V m + 1 m + 1/4 1/ + O, 1 with equality when G is the complete graph of order n + 1, where the O term is + 4 4/8. Bollobás and Scott [6] also showed that the vertex set of any graph G with m edges can be partitioned into V 1,..., V such that for i {1,,..., }, ev i m + 1 m + 1/4 1/. Recently, Xu and Yu [18] showed that a -partition V 1,..., V can be found that satisfies both inequalities 1 and simultaneously, generalizing an earlier bipartition result of Bollobás and Scott [6] as mentioned previously. It is natural to as whether Theorems 1.1 and 1.3 can be extended to -partitions. We show that the generalization of Theorem 1.3 to -partitions does hold for all even integers. 3
4 Theorem 1.4 Let > 0 be an even integer, and let d and m be the same as in Theorem 1.3. Then, g m m + 1 4d m m1/4 + O. We also prove the following generalization of Theorem 1.1, which we thin should be useful for extending Theorem 1.3 to -partitions for odd integers. Theorem 1.5 For any integer, there exist positive constants c = O1/ and N = O 3 such that for every even integer n > N, if m = n / then f m m + 1 m + cm 1/4. We organize this paper as follows. In Section, we prove Theorem 1.3 by establishing a sequence of lemmas. In Section 3, we first present the proof of Theorem 1.4, and then prove Theorem 1.5 by refining Alon s original proof of Theorem 1.1. In Section 4, we offer some concluding remars. Bipartitions In this section, we prove Theorem 1.3. Our proof is divided into several cases according to values of fg eg/. Since we will be using maximum bipartite subgraphs to find good judicious partitions, we need a result from [] which establishes a connection between fg and gg; a similar connection between f G and g G can be found in Bollobás and Scott [10]. Lemma.1 Alon, Bollobás, Krivelevich and Sudaov Let G be a graph with m edges and fg = m/+δ. If δ m/30 then there exists an absolute constant D such that, when m D there exists a bipartition V G = V 1 V satisfying max{ev 1, ev } m 4 m If δ m/30, then there exists a partition V G = V 1 V such that max{ev 1, ev } m 4 δ + 10δ m + 3 m. 4 The following easy consequence of Lemma.1 proves Theorem 1.3 for graphs G with eg = m and fg m/ m/10 4. Lemma. There exists an absolute constant M 1 > 0 such that the following holds. If G is a graph with m edges and fg = m/ + δ, m M 1, and δ m/10 4, then there exists a bipartition V G = V 1 V such that for i = 1,, ev i m 4 m
5 Proof. Let D be from Lemma.1. Let M 1 D be a sufficiently large constant here and later we do not express the constants explicitly to eep the presentation clear. Then by Lemma.1, we may assume that m/10 4 δ m/30, and that there exists a partition V G = V 1 V such that 4 holds. As the function hδ := δ/ + 10δ /m achieves its maximum at δ = m/40, we see that ev i m 4 + hm/ m m/4 m/ for each i = 1,. In view of Lemma., it suffices to prove Theorem 1.3 for graphs G with fg m/ m/10 4. We will find special vertices that we could use to modify existing bipartitions. This will be done in the next lemma and Lemma.5, using the approach described in the introduction. Lemma.3 Let G be a graph with m edges, and assume fg = m/ + δ, where δ m/10 4. Suppose V G = V 1 V is a partition such that ev, V 1 ev, V for every v V 1, and ev 1 m/4 δ/. Then there exists v V 1 such that ev, V 1 m/ + 3 δ and ev, V δ/mev, V 1. Proof. Let and T = {v V 1 : ev, V 1 > m/ + 3 δ} S = {v V 1 : ev, V > δ/m ev, V 1 }. We will show that v V 1 ev, V 1 > v S T ev, V 1, from which the existence of the desired vertex v follows. To this end, we bound v T ev, V 1 and v S ev, V 1. Since ev, V 1 ev, V for all v V 1, On the other hand, ev 1 = 1 ev, V 1 1 ev, V = 1 ev 1, V fg = m 4 + δ. v V 1 v V 1 ev 1 = v V 1 ev, V 1 v T ev, V 1 > m/ + 3 δ T, implying that T < ev 1 m/ + 3 δ m/ + δ m/ + 3 δ < m/ 3 δ, where the final inequality holds because δ m/10 4. Hence ev, V 1 ev 1 + et < ev T < ev v T m/ 3 δ. Since δ m/10 4, we have ev, V 1 < ev 1 + m 4 3 mδ/. 5 4 v T 5
6 Note that ev 1, V = v S ev, V + v V 1 S ev, V, so ev 1, V δ/m ev, V 1 + v S v V 1 S ev, V 1 = ev δ/m v S ev, V 1. Together with ev 1 m/4 δ/ and ev 1, V fg = m/ + δ, we get ev, V 1 < 1 m/δ ev1, V ev 1 1 mδ v S Combining 5 and 6, we have v S T ev, V 1 < ev 1 + m mδ/, implying that v V 1 ev, V 1 = ev 1 ev 1 + m 4 δ > ev 1 + m mδ/ > v S T ev, V 1, where the first inequality follows from ev 1 m/4 δ/ and the second inequality holds because δ m/10 4. So V 1 S T, completing the proof. The following result says that there exists an absolute constant C > 0 such that Theorem 1.3 holds for graphs G with m edges and m/8 + Cm 1/4 fg m/ m/10 4. Lemma.4 Let c be the absolute constant in Theorem 1.1, let d = c/4, and let C := 70+d. There exists an absolute constant M > 0 such that the following holds. If G is a graph with m edges, fg = m/ + δ, m M, and m/8 + Cm 1/4 δ m/10 4, then there exists a partition V G = V 1 V such that for i = 1,, ev i m/4 + m/3 dm 1/4. Proof. Let M > 0 be a sufficiently large constant. Let U 1, U be a maximum cut of G, i.e., eu 1, U = fg = m + δ. Without loss of generality we may assume eu 1 eu. Note that ev, U 1 ev, U for every v U 1 ; otherwise, eu 1 {v}, U {v} > eu 1, U = fg, a contradiction. Hence eu 1 = 1 ev, U 1 1 ev, U = 1 eu 1, U = m 4 + δ. v U 1 v U 1 We now define a process to move vertices from U 1 to U, using Lemma.3, such that in the end we get the desired bipartition. Initially, we set V1 0 := U 1, V 0 := U. Let V1 i V i denote the partition of V G after the ith iteration. If ev1 i m/4 δ/ + m/ + 3 δ/, set V 1 := V1 i and V := V i, and stop. If ev1 i > m/4 δ/ + m/ + 3 δ/ then by Lemma.3, there exists u i V1 i such that eu i, V1 i m/ + 3 δ and eu i, V i δ/m eu i, V1 i. Set V i+1 1 := V i 1 {u i}, V i+1 := V i {u i}, and repeat the above steps for V i+1 1, V i+1. 6
7 Note that, after i iterations for each i, we always have ev, V1 i ev, V i for every v V i 1 ; so Lemma.3 may be applied to V1 i, V i. Let V 1 = V1, V = V denote the final partition, after iterations. Then ev 1 m 4 δ + m/8 + 3 δ. Moreover, since V 1 is obtained from V 1 1 by moving u 1 to V 1, we have ev 1 > m 4 δ 1 m/ + 3 δ. Since ev 1 = eu 1 1 i=0 eu i, V1 i, we have 1 eu i, V1 i = eu 1 ev 1 < eu 1 m 4 + δ + 1 m/ + 3 δ. i=0 Hence, since eu = m eu 1, U eu 1 = m/ δ eu 1 and eu i, V i < δ/meu i, V1 i, we have 1 ev = eu + eu i, V i i=0 m δ eu δ/m eu i, V1 i m δ eu δ/m = m 4 δ m/ + m 4 δ m/ + i=0 eu 1 m 4 + δ + 1 δ + 0 δ/m eu 1 m 4 + δ + 1 δ + 0 δ/m δ m/ + δ = m 4 δ + m/8 + 3/ + 5 δ + 0 δ3/ m + 30 δ m. 3 m/ + δ 3 m/ + δ since eu 1 m/4 + δ/ Therefore, where max{ev 1, ev } m 4 + m/8 + hδ, hδ := δ + 3/ + 5 δ + 0 δ3/ m + 30 δ m. Since m M is sufficiently large, one can verify that hδ is a decreasing function in the domain m/8 + Cm 1/4 δ m/10 4. Therefore, max{ev 1, ev } m 4 + m/8 + h m/8 + Cm 1/4 < m 4 + m/3 C m1/4 + 70m 1/4 since m/8 + Cm 1/4 < m = m 4 + m/3 dm 1/4 since C = 70 + d, 7
8 completing the proof of this lemma. The next result is similar to Lemma.3, which will be used to prove Theorem 1.3 for graphs G with m edges and fg m/ m/8 + Cm 1/4. Lemma.5 Let c be the constant in Theorem 1.1 and d, C be the constants in Lemma.4. There exists an absolute constant M 3 > 0 such that the following holds. If G is a graph with m M 3 edges, fg = m/ + δ, m/8 + cm 1/4 δ m/8 + Cm 1/4, V G = V 1 V is a bipartition such that ev, V 1 ev, V for every v V 1, and ev 1 m/4 + m/3 dm 1/4 then there exists v V 1, such that ev, V 1 m/ + c 6 δ and ev, V 1 + c δ/m ev, V 1. 4 Proof. Let M 3 > 0 be a sufficiently large constant compared to c, d and C. And let { T = v V 1 : ev, V 1 > m/ + c } δ 6 and S = { v V 1 : ev, V > 1 + c } δ/m ev, V 1. 4 Since ev, V 1 ev, V for all v V 1, we have On the other hand, ev 1 1 ev 1, V fg ev 1 v T ev, V 1 > = m 4 + δ. c m/ + δ T. 6 Thus ev 1 T < m/ + c 6 δ m/ + δ < m/ c δ, δ 1 m/ + c 6 where the last inequality holds because m/8 + cm 1/4 δ m/8 + Cm 1/4 and m M 3 is large enough. From v T ev, V 1 ev 1 + et, we obtain that ev, V 1 ev v T Since ev 1, V = v S ev, V + v V 1 S ev, V, ev 1, V 1 + c δ/m ev, V v S c m/ δ ev1 + m 1 4 c mδ/. 7 4 v V 1 S 8 ev, V 1 = ev 1 + c δ/m ev, V 1. 4 v S
9 Therefore ev, V 1 4 m/δ ev1, V ev 1, c v S which, together with ev 1, V m/ + δ, ev 1 m/4 + m/3 dm 1/4 and δ m/8 + Cm 1/4, imply that ev, V 1 4 c C + d m/δ m 1/4. 8 v S Again, because ev 1 m/4 + m/3 dm 1/4, we have ev, V 1 = ev 1 ev 1 + m/4 + m/3 dm 1/4. 9 v V 1 When m M 3, in view of δ = Θ m, we see m/3 dm 1/4 > 4 c C + d m/δ m 1/4 c mδ/, 4 which, combining with 7, 8 and 9, imply that So we get V 1 S T as desired. v V 1 ev, V 1 > Now we are ready to prove Theorem 1.3. v S T ev, V 1. Proof of Theorem 1.3. Let c, M be the absolute constants in Theorem 1.1, and let M 1, M, M 3 be the absolute constants in Lemmas.,.4 and.5, respectively. Let d := c/4, M := max{m 1, M, M 3 }, and N max{m, M 1/ } be a sufficiently large constant. Let m = n /, where n N is even; so n M and m M i for i = 1,, 3, and hence we may apply Theorem 1.1 and Lemmas. and.4 and.5. Let G be a graph with m edges and fg = m/ + δ. By Theorem 1.1, Lemma. and.4, we may assume that m/8 + cm 1/4 δ m/8 + Cm 1/4. 10 Let V G = U 1 U, with eu 1, U = fg = m + δ and eu 1 eu. Then, as before, we see that ev, U 1 ev, U for every v U 1. We now describe a process similar to that in the proof of Lemma.4, to obtain the desired bipartition. Set V1 0 := U 1, V 0 := U, and let V G = V1 i V i iterations. be the partition obtained after i If ev1 i m/4 + m/3 dm 1/4, then set V 1 := V1 i and V := V i, and stop. 9
10 If ev1 i > m/4 + m/3 dm 1/4 then by Lemma.5, there exists a vertex u i V1 i such that eu i, V1 i m/ + c δ and eui, V i 1 + c δ/m eu i, V1 i. 6 4 Set V i+1 1 := V i 1 {u i}, V i+1 := V i {u i}, and repeat the above steps for V i+1 1, V i+1. Note that, in each iteration of the above procedure, we always have ev, V1 i ev, V i for every v V1 i ; thus Lemma.5 may be applied for V i 1, V i. Let V 1 = V1, V = V be the final partition, obtained after steps. Then ev 1 m/4 + m/3 dm 1/4, and ev 1 > m/4 + m/3 dm 1/4 c m/ + δ. 6 It suffices to show the upper bound of ev. Since ev, U 1 ev, U for every v U 1, Since ev 1 = eu 1 1 i=0 eu i, V1 i, we have i=0 eu 1 1 eu 1, U = m 4 + δ. 1 eu i, V1 i = eu 1 ev 1 < eu 1 m/4 m/3 + dm 1/4 + m/ + 6 c δ. Then, since ev = eu + 1 i=0 eu i, V i, eu i, V 1 i + c δ 4 m eu i, V1 i and eu 1 m/4 + δ/, we have ev m δ eu c δ 1 eu i, V1 i 4 m i=0 < m δ eu c δ/m eu 1 m 4 4 m/3 + dm 1/4 + m/ + c δ 6 = m 4 δ + 3 m/3 + dm 1/4 + c c δ + δ/m eu 1 m m/3 + dm 1/4 + c 6 m 4 δ + 3 m/3 + dm 1/4 + c 6 By 10, it holds that dm 1/4 + c/6 δ < m/3. Hence, δ + c 4 δ/m δ + 3 m/3 + dm 1/4 + c 6 ev m m/3 + dm 1/4 + hδ, δ. δ where c hδ := δ c δ c m δ3/ 10
11 is a decreasing function in the domain of 10, provided that m N / is sufficiently large. Therefore, we have ev m m/3 + dm 1/4 + h m/8 + cm 1/4 m m/3 + dm 1/4 m/8 c 4 m1/4 using m/8 + cm 1/4 < m = m 4 + m/3 dm 1/4 since d = c/4. This completes the proof of Theorem Partitions In this section, we first show Theorem 1.4, extending Theorem 1.3 to all multiple partitions with even parts. Proof of Theorem 1.4. Write := t for some integer t > 0 and let d, m be the same as in Theorem 1.3. Consider an arbitrary graph G with m edges. By Theorem 1.3, there exists a bipartition V G = V 1 V such that for i = 1,, e i := ev i m/4 + m/3 dm 1/4. Using the inequality 1 + x 1 + x for x 1, we have ei m/ / m/3 dm 1/4 /m/4 = m/ + O1. By the equation, each G[V i ] has a t-partition V1 i,..., V t i such that for j {1,,..., t}, evj i e i t + t 1 t e i + Ot m 1 4t + = m + 1 m 4d m1/4 + O. 8t + t 1 4t These two t-partitions together form a desired -partition of G. m d t m1/4 + Ot Next we generalize the proof of Alon in [1] to prove Theorem 1.5. We need the following lemma which appears in several articles, for example, as Lemma.1 in [1]. Lemma 3.1 Let G = V, E be an s-colorable graph with m edges. Then for any positive integer s, ts, f G s m, where ts, = s + i 1 s + j 1. 1 i<j In the coming proof of Theorem 1.5, we will be using Lemma 3.1 for ts,. Note that s ts, = s and ts, / = s 1. 11
12 Proof of Theorem 1.5. Fix, and let ɛ = /4, c = 8 ɛ, and N = 3 3. We do not attempt to optimize these constants. Let n be an even integer such that n N. Consider an arbitrary graph G with m = n / edges. Let s denote the unique integer satisfying n ɛ n + 1 < s n ɛ n Claim 1. We may assume that χg s + 1. For, suppose G is s-colorable. Then ts, f G m by Lemma 3.1 s = 1 m + 1 m s 1 m + 1 n n ɛ n + m + 1 n + ɛ n m + 1 This proves Claim 1. since m = n / and s n ɛ n since n N = 3 3 and ɛ = 1/16 m ɛm1/4 since m = n / and 1/4 1/8. Let H G such that χh = χg and H is vertex-critical. Then δh χg 1 s n ɛ n. Since eh n /, V H eh/δh n + ɛ n. Then there are at least n 4ɛ n color classes of size 1 in any proper coloring of H using χg colors. So there exists a complete subgraph R of G with V R := n r n 4ɛ n. Note that r 4ɛ n and Hence, n r er = er = n r + 1/ = n r + 1n rr O1 m ɛ 8n + O1, where the O1 term is 1/ 1/8. Let W := V G V R. Then ew + er, W = m er = rn r + n + r r. Claim. We may assume that ew n/8. Otherwise, assume ew n/8. By the equation 1, there exist -partitions W = i=1 W i and V R = i=1 R i such that ew 1,..., W ew + 1 ew + O ew + 1 n/ + O, 4 1
13 and er 1,..., R er + 1 er + 1 er + O 1 m 4ɛ n + O. For any permutation π [], we define eπ := i=1 ew i, R πi ; then eπ = 1! ew, R. π [] Thus there exists a permutation π [] such that eπ 1! ew, R/! = ew, R/. So ew 1 R π1,..., W R π =ew, R eπ + ew 1,..., W + er 1,..., R 1 ew, R + ew n/ + 4 er + 1 = 1 m m + m1/ O m + 1 m m1/4 + O. 1 m 4ɛ n + O Note that the O term here is + 4 4/8 + 1/ 1/8. Since m > n / > 3 3 /, we see that ew 1 R π1,..., W R π m + 1 m + cm 1/4. So the assertion of the theorem holds with the partition W 1 R π1,..., W R π, completing the proof of Claim. Let v 1, v,..., v n r be the vertices of R and let d i := Nv i W for 1 i n r, where d 1 d... d n r. Since R is complete, a balanced -partition of V R i.e., the sizes of parts differ by at most 1 gives f R. So let V R = i=1 R i be a -partition such that n r = R 1 R... R = n r, and let R 1 = {v 1,..., v n r er 1,..., R er + 1 er + O, }. Then where the O term is + 4 4/8. Let 1 i n r D := d i ew, R = n r n r, and D 0 := D D. Then, since ew + er, W = rn r + n/ + r r/, we have D 0 = n/ + r r/ ew. n r Since r 4ɛ n, n N and ew n/8, we conclude that min{d 0, 1 D 0 } 13 n 5n r.
14 Hence, D differs from an integer by at least n 5n r. Claim 3. ew, R... R 1 ew, R + n 5. To see this, let us consider two cases. If d n r D then d n r D+ n so Claim 3 follows as ew, R... R = d i i> n r 1 n r D + Otherwise, d n r D; then d n r D n 5n r ew, R 1 = d i i n r n r D n 5n r by integrality. Hence 5n r by integrality; = 1 1 ew, R + 5 n. n 1 5n r ew, R n 5 ; so ew, R... R 1 ew, R + n 5, completing the proof of Claim 3. Now, consider the -partition W R 1, R,..., R of V G. Since er 1,..., R 1 er+ 1 er + O and by Claim 3, We have ew R 1, R,..., R =er 1, R,..., R + ew, R... R er er + ew, R + n 5 + O m 1 ew m 4ɛ n + n 5 + O as er m ɛ 8m + O1 m m m 8 1 m 4ɛm1/4 + + O by Claim 5 m + 1 m + cm 1/4, where the last inequality holds because n N 3 3 and the O term is + 4 4/8. 4 Concluding remars We point out that Theorem 1.3 is best possible up to the constant d. To see this, let m = n +1. The lower bound on fm remains unchanged since the proof in [1] wors for values of m which differ from n / by a constant; so our proof also gives the same upper bound on gm. Let G be the vertex-disjoint union of K n and K, where n is odd, is even, and n = 1 1. Let m := eg = n +. An easy calculation shows that gg = n+1 + = m4 + m/3 m1/4 4 + O1. This shows that for m = n +1, gm m/4 + m/3 m 1/4 /8 + O1. 14
15 In our proof of Theorem 1.3, we choose d = c/4, where c is the constant from Theorem 1.1. The calculation in the end of the proof of Theorem 1.3 in fact only requires that d c+o1 d, where the O1 term may be made arbitrarily small when m is sufficient large. So one can show that for any ɛ > 0, there exists an integer N = Nɛ such that when n N, gm m 4 + c m/3 ɛ m 1/4. We do not now if one can get rid of the ɛ. Our proofs of Lemmas.3 and.4 may be modified to show that if G is graph with m edges, fg = m/+δ, and δ αm, then for sufficiently large m, there is a partition V G = V 1 V such that max{ev 1, ev } m 4 δ + m/8 + β δ + γ δ3/, m where α is an absolute constant and β, γ are constants depend on α only. When δ = Om t, where t < 3, this bound is better than Lemma.1, since m/8 dominates δ, δ 3/ / m while 3 m dominates 10δ /m in Lemma.1. Another conclusion we may draw from the proofs of Lemmas.3 and.4 is that: If fg m/+ m/8+α, where α = Θm t and 1 4 < t < 1, then gg m/4+ m/3+om 1/4 α/. We conclude our discussion with the following natural question: Is it also true that for every integer, the limsup of m + 1 m + 1/4 1/ g m tends to infinity when m tends to infinity? Theorem 1.4 has answered this question when is even. For the case that is odd, Theorem 1.5 and results of Bollobás and Scott in [10] seem to be relevant. Acnowledgment. We would lie to than two anonymous referees for their helpful comments and suggestions. We are grateful to a referee for bringing reference [3] to our attention and for arising a related question which enables us to discover Theorem 1.4. References [1] N. Alon, Bipartite subgraphs, Combinatorica [] N. Alon, B. Bollobás, M. Krivelevich and B. Sudaov, Maximum cuts and judicious partitions in graphs without short cycles, J. Combin. Theory Ser. B [3] N. Alon and E. Halperin, Bipartite subgraphs of integer weighted graphs, Discrete Math [4] P. Berman and M. Karpinsi, On some tighter inapproximability results, extended abstract Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, [5] B. Bollobás and A. D. Scott, On judicious partitions, Period. Math. Hungar
16 [6] B. Bollobás and A. D. Scott, Exact bounds for judicious partitions of graphs, Combinatorica [7] B. Bollobás and A. D. Scott, Problems and results on judicious partitions, Random Structures and Algorithms [8] B. Bollobás and A. D. Scott, Better bounds for Max Cut, in Contemporary Comb, Bolyai Soc Math Stud 10, János Bolyai Math Soc, Budapest, [9] B. Bollobás and A. D. Scott, Judicious partitions of bounded-degree graphs, J. Graph Theory [10] B. Bollobás and A. D. Scott, Max -cut and judicious -partitions, Discrete Math [11] C. S. Edwards, Some extremal properties of bipartite graphs, Canadian J. math [1] C. S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, in Proc. nd Czechoslova Symposium on Graph Theory, Prague [13] P. Erdős, Some recent problems in Combinatorics and Graph Theory, Proc. 6 th Southeastern International Conference on Graph Theory, Combinatorics and Computing, Boca Raton, 1995, Congressus Numerantium. [14] U. Feige, M. Karpinsi, and M. Langberg, Improved approximation of max-cut on graphs of bounded degree, J. Algorithms [15] M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability using semidefinite programming, J. ACM [16] R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. Miller and J. Thatcher, eds Plenum Press, New Yor, [17] A. Scott, Judicious partitions and related problems, in Surveys in Combinatorics 005 pp , London Math. Soc. Lecture Note Ser., 37, Cambridge Univ. Press, Cambridge, 005. [18] B. Xu and X. Yu, Better bounds for -partitions of graphs, Combinatorics, Probability and Computing [19] M. Yannaais, Node- and Edge-Deletion NP-Complete Problems, STOC
Better bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
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 informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
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 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 informationBipartite Subgraphs of Integer Weighted Graphs
Bipartite Subgraphs of Integer Weighted Graphs Noga Alon Eran Halperin February, 00 Abstract For every integer p > 0 let f(p be the minimum possible value of the maximum weight of a cut in an integer weighted
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 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 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 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 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 informationA DEGREE VERSION OF THE HILTON MILNER THEOREM
A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationBisections of graphs
Bisections of graphs Choongbum Lee Po-Shen Loh Benny Sudakov Abstract A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and
More 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 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 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 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 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 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 informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
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 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 informationOn the number of edge-disjoint triangles in K 4 -free graphs
On the number of edge-disjoint triangles in K 4 -free graphs arxiv:1506.03306v1 [math.co] 10 Jun 2015 Ervin Győri Rényi Institute Hungarian Academy of Sciences Budapest, Hungary gyori.ervin@renyi.mta.hu
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 informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
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 informationChoosability and fractional chromatic numbers
Choosability and fractional chromatic numbers Noga Alon Zs. Tuza M. Voigt This copy was printed on October 11, 1995 Abstract A graph G is (a, b)-choosable if for any assignment of a list of a colors to
More 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 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 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 informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationOn 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 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 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 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 informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
More informationOn splitting digraphs
On splitting digraphs arxiv:707.03600v [math.co] 0 Apr 08 Donglei Yang a,, Yandong Bai b,, Guanghui Wang a,, Jianliang Wu a, a School of Mathematics, Shandong University, Jinan, 5000, P. R. China b Department
More 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 informationJUDICIOUS PARTITIONS OF GRAPHS AND HYPERGRAPHS
JUDICIOUS PARTITIONS OF GRAPHS AND HYPERGRAPHS A Thesis Presented to The Academic Faculty by Jie Ma In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Mathematics
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
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 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 informationA sequence of triangle-free pseudorandom graphs
A sequence of triangle-free pseudorandom graphs David Conlon Abstract A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More 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 informationSmall subgraphs of random regular graphs
Discrete Mathematics 307 (2007 1961 1967 Note Small subgraphs of random regular graphs Jeong Han Kim a,b, Benny Sudakov c,1,vanvu d,2 a Theory Group, Microsoft Research, Redmond, WA 98052, USA b Department
More 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 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 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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationFIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS
FIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS Luke Postle 1 Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30323, USA and Robin Thomas
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationRainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs
Rainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs Jennifer Diemunsch Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, and Paul S. Wenger Abstract A rainbow matching in an edge-colored
More informationOdd independent transversals are odd
Odd independent transversals are odd Penny Haxell Tibor Szabó Dedicated to Béla Bollobás on the occasion of his 60th birthday Abstract We put the final piece into a puzzle first introduced by Bollobás,
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More 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 informationCompatible Hamilton cycles in Dirac graphs
Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov Abstract A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated
More informationLarge monochromatic components and long monochromatic cycles in random hypergraphs
Large monochromatic components and long monochromatic cycles in random hypergraphs Patric Bennett Louis DeBiasio Andrzej Dude Sean English September 9, 2017 Abstract We extend results of Gyárfás and Füredi
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 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 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 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 informationRestricted b-matchings in degree-bounded graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationExcluded permutation matrices and the Stanley Wilf conjecture
Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that
More informationTree Decomposition of Graphs
Tree Decomposition of Graphs 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. It is shown
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 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 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 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 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 informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationOn decompositions of complete hypergraphs
On decompositions of complete hypergraphs Sebastian M Cioabă 1, Department of Mathematical Sciences, University of Delaware, Newar, DE 19716, USA André Kündgen Department of Mathematics, California State
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
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 informationThe Lopsided Lovász Local Lemma
Department of Mathematics Nebraska Wesleyan University With Linyuan Lu and László Székely, University of South Carolina Note on Probability Spaces For this talk, every a probability space Ω is assumed
More informationAn asymptotically tight bound on the adaptable chromatic number
An asymptotically tight bound on the adaptable chromatic number Michael Molloy and Giovanna Thron University of Toronto Department of Computer Science 0 King s College Road Toronto, ON, Canada, M5S 3G
More informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
More informationNew upper bound for sums of dilates
New upper bound for sums of dilates Albert Bush Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303, USA albertbush@gmail.com yzhao6@gsu.edu Submitted: Nov 2, 2016;
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationEquivalent Formulations of the Bunk Bed Conjecture
North Carolina Journal of Mathematics and Statistics Volume 2, Pages 23 28 (Accepted May 27, 2016, published May 31, 2016) ISSN 2380-7539 Equivalent Formulations of the Bunk Bed Conjecture James Rudzinski
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 informationExtensions of the linear bound in the Füredi Hajnal conjecture
Extensions of the linear bound in the Füredi Hajnal conjecture Martin Klazar Adam Marcus May 17, 2006 Abstract We present two extensions of the linear bound, due to Marcus and Tardos, on the number of
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 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 informationEquitable coloring of random graphs
Michael Krivelevich 1, Balázs Patkós 2 1 Tel Aviv University, Tel Aviv, Israel 2 Central European University, Budapest, Hungary Phenomena in High Dimensions, Samos 2007 A set of vertices U V (G) is said
More informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationAn alternative proof of the linearity of the size-ramsey number of paths. A. Dudek and P. Pralat
An alternative proof of the linearity of the size-ramsey number of paths A. Dudek and P. Pralat REPORT No. 14, 2013/2014, spring ISSN 1103-467X ISRN IML-R- -14-13/14- -SE+spring AN ALTERNATIVE PROOF OF
More 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 5,6 and Derrick Stolee 7 Abstract Given
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 informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More information