A note on Gallai-Ramsey number of even wheels
|
|
- Jessie Johns
- 5 years ago
- Views:
Transcription
1 A note on Gallai-Ramsey number of even wheels Zi-Xia Song a, Bing Wei b, Fangfang Zhang c,a, and Qinghong Zhao b a Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA b Department of Mathematics, University of Mississippi, Oxford, MS 38677, USA c Department of Mathematics, Nanjing University, Nanjing , P. R. China January 28, 2019 Abstract A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai k-coloring is a Gallai coloring that uses k colors. Given a graph H and an integer k 1, the Gallai-Ramsey number GR k (H) of H is the least positive integer N such that every Gallai k-coloring of the complete graph K N contains a monochromatic copy of H. Let W 2n denote an even wheel on 2n vertices. In this note, we study Gallai-Ramsey number of W 2n and completely determine the exact value of GR k (W 4 ) for all k 2. Key words: Gallai coloring, Gallai-Ramsey number, rainbow triangle 2010 Mathematics Subject Classification: 05C55; 05D10; 05C15 1 Introduction All graphs in this paper are finite, simple and undirected. Given a graph G and a set S V (G), we use G to denote the number of vertices of G, and G[S] to denote the subgraph of G obtained from G by deleting all vertices in V (G) \ S. For two disjoint sets A, B V (G), A is complete to B in G if every vertex in A is adjacent to all vertices in B. We use K n, C n, P n to denote the complete graph, cycle, and path on n vertices, respectively; and W n to denote a wheel on n + 1 vertices. For any positive integer k, we write [k] for the set 1,..., k}. We use the convention S := to mean that S is defined to be the right-hand side of the relation. Given an integer k 1 and graphs H 1,..., H k, the classical Ramsey number R(H 1,..., H k ) is the least integer N such that every k-coloring of the edges of K N contains a monochromatic copy of H i in color i for some i [k]. Ramsey numbers are notoriously difficult to compute in general. Very little is known for Ramsey numbers of Corresponding author. address: fangfangzh@smail.nju.edu.cn 1
2 wheels and the exact value of R(W n, W n ) is only known for n 3, 4, 5} (see [11, 14, 7]). In this paper, we study Ramsey number of wheels in Gallai colorings, where a Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles (that is, a triangle with all its edges colored differently). Gallai colorings naturally arise in several areas including: information theory [15]; the study of partially ordered sets, as in Gallai s original paper [10] (his result was restated in [13] in the terminology of graphs); and the study of perfect graphs [4]. More information on this topic can be found in [8, 9]. A Gallai k-coloring is a Gallai coloring that uses k colors. Given an integer k 1 and graphs H 1,..., H k, the Gallai-Ramsey number GR(H 1,..., H k ) is the least integer N such that every (K N, τ) contains a monochromatic copy of H i in color i for some i [k]. When H = H 1 = = H k, we simply write GR k (H) and R k (H). Clearly, GR k (H) R k (H) for all k 1 and GR(H 1, H 2 ) = R(H 1, H 2 ). In 2010, Gyárfás, Sárközy, Sebő and Selkow [12] proved the general behavior of GR k (H). Theorem 1.1 ([12]). Let H be a fixed graph with no isolated vertices and let k 1 be an integer. Then GR k (H) is exponential in k if H is not bipartite, linear in k if H is bipartite but not a star, and constant (does not depend on k) when H is a star. It turns out that for some graphs H (e.g., when H = C 3 ), GR k (H) behaves nicely, while the order of magnitude of R k (H) seems hopelessly difficult to determine. It is worth noting that finding exact values of GR k (H) is far from trivial, even when H is small. The following structural result of Gallai [10] is crucial in determining the exact value of Gallai-Ramsey number of a graph H. Theorem 1.2 ([10]). For any Gallai coloring τ of a complete graph G with G 2, V (G) can be partitioned into nonempty sets V 1, V 2,..., V p with p > 1 so that at most two colors are used on the edges in E(G) \ (E(V 1 ) E(V p )) and only one color is used on the edges between any fixed pair (V i, V j ) under τ, where E(V i ) denotes the set of edges in G[V i ] for all i [p]. The partition given in Theorem 1.2 is a Gallai partition of the complete graph G under τ. Given a Gallai partition V 1,..., V p of the complete graph G under τ, let v i V i for all i [p] and let R := G[v 1,..., v p }]. Then R is the reduced graph of G corresponding to the given Gallai partition under τ. By Theorem 1.2, all edges in R are colored by at most two colors under τ. One can see that any monochromatic copy of H in R will result in a monochromatic copy of H in G under τ. It is not surprising that Gallai-Ramsey number GR k (H) is closely related to the classical Ramsey number R 2 (H). The following is a conjecture of Fox, Grinshpun and Pach [8] on GR k (H) when H is a complete graph. 2
3 Conjecture 1.3 ([8]). For all k 1 and t 3, GR k (K t ) = (R2 (K t ) 1) k/2 + 1 if k is even (t 1)(R 2 (K t ) 1) (k 1)/2 + 1 if k is odd. The first case k = 3 of Conjecture 1.3 follows directly from a result of Chung and Graham [6] from 1983, and a simpler proof can be found in [12]. Recently, the case k = 4 of Conjecture 1.3 was proved in [18]. In this note, we study Gallai-Ramsey number of even wheels. We use (G, τ) to denote a Gallai k-colored complete graph if G is a complete graph and τ : E(G) [k] is a Gallai k-coloring. For any A, B V (G), if all the edges between A and B are colored the same color, say blue, under τ, we say that A is blue-complete to B in (G, τ). We simply say a is blue-complete to B in (G, τ) when A = a}. We first prove the following general lower bound for GR k (W 2n ) for all k 2 and n 2. Proposition 1.4. For all n 2 and k 2, GR k (W 2n ) (R2 (W 2n ) 1) 5 (k 2)/2 + 1 if k is even 2(R 2 (W 2n ) 1) 5 (k 3)/2 + 1 if k is odd. Proof. Let m := R 2 (W 2n ) 1 and G 2 := K m. Let (G 2, τ 2 ) be Gallai 2-colored with colors 1, 2 such that G 2 has no monochromatic copy of W 2n under τ 2. We then construct (G k, τ k ) recursively for all k 3. When k 3 is even, let (H, c) := (K 5, c) be such that edges of H are colored by colors k and k 1 with no monochromatic copy of K 3. Let (G k, τ k ) be obtained from (H, c) by replacing each vertex of H with (G k 2, τ k 2 ). When k 3 is odd, let (G k, τ k ) be the join of two disjoint copies of (G k 1, τ k 1 ), with all the new edges colored by color k. Clearly, (G k, τ k ) has no rainbow triangle and no monochromatic copy of W 2n. Hence, GR k (W 2n ) G k + 1, as desired. The main result in this note is Theorem 1.5 below, which establishes the exact value of GR k (W 4 ) for all k 2. Theorem 1.5. For all k 2, GR k (W 4 ) = 14 5 k , if k is even, 28 5 k , if k is odd. With the support of Theorem 1.5, it seems that the lower bound given in Proposition 1.4 is also the desired upper bound for GR k (W 2n ). We propose the following conjecture. 3
4 Conjecture 1.6. For all k 2 and n 2, (R 2 (W 2n ) 1) 5 k , if k is even, GR k (W 2n ) = 2(R 2 (W 2n ) 1) 5 k , if k is odd. It is worth noting that very recently, Gallai-Ramsey number of some other graphs with at most five vertices were studied by Li and Wang [17]. More recent work on Gallai-Ramsey numbers of cycles can be found in [3, 1, 2, 5, 20, 19, 16]. 2 Proof of Theorem 1.5 Let f(1) := 4 and for all k 2, let f(k) := 14 5 k 2 2, if k is even, 28 5 k 3 2, if k is odd. Then for all k 3, f(k) 2f(k 1), 5f(k 2). ( ) By Proposition 1.4, it suffices to show that for all k 2, GR k (W 4 ) f(k) + 1. By a result in [14], R 2 (W 4 ) = 15 and so GR 2 (W 4 ) = R 2 (W 4 ) = f(2) + 1. We may assume that k 3. Let G := K f(k)+1 and let τ : E(G) [k] be any Gallai k-coloring of G. Suppose that (G, τ) does not contain any monochromatic copy of W 4. Then τ is bad. Among all complete graphs on f(k)+1 vertices with a bad Gallai k-coloring, we choose (G, τ) with k minimum. We next prove several claims. Claim 1. Let A V (G) and let i [k] be a color, say blue. If (G[A], τ) has no blue P 3, then A f(k 1). Proof. Suppose A f(k 1) + 1. By the minimality of k, GR k 1 (W 4 ) f(k 1) + 1. Then A GR k 1 (W 4 ). Since k 3, let red be another color in [k] \ i}, and let τ be obtained from τ by replacing colors red and blue with a new color, say β / [k]. Then τ is a Gallai (k 1)-coloring of G and so (G[A], τ ) contains a monochromatic copy of W := W 4 because A GR k 1 (W 4 ). Since (G[A], τ) contains no monochromatic W 4, it follows that W must be a monochromatic W 4 in color β. For the remaining proof of this claim, we use W 4 = (u 1, u 2, u 3, u 4 ; u 0 ) to denote a wheel on 5 vertices, where W 4 \ u 0 is a cycle with vertices u 1, u 2, u 3, u 4 in order, and u 0 is complete to u 1, u 2, u 3, u 4 }. Let W = (u 1, u 2, u 3, u 4 ; u 0 ). Then W has at most two independent blue edges under τ, because (G[A], τ) has no blue P 3. Thus W [u 1, u 2, u 3, u 4 }] must be a red C 4 under τ, otherwise, say u 1 u 2 is blue. Then u 1, u 2 } is red-complete to u 3, u 4, u 0 } in G under τ. We may further assume that u 0 u 3 is red under τ. But then we obtain a red W 4 = (u 1, u 4, u 2, u 3 ; u 0 ) under τ when u 0 u 4 is red; and a red 4
5 W 4 = (u 0, u 2, u 4, u 1 ; u 3 ) under τ when u 0 u 4 is blue, a contradiction. This proves that W [u 1, u 2, u 3, u 4 }] is a red C 4 under τ. Since (G[A], τ) has no blue P 3, we see that exactly one of the edges u 0 u 1, u 0 u 2, u 0 u 3, u 0 u 4, say u 0 u 1 is blue under τ. But then we obtain a red W 4 = (u 1, u 2, u 0, u 4 ; u 3 ) under τ, a contradiction. Claim 2. Let A V (G) and let i, j [k] be two distinct colors, say red and blue. If (G[A], τ) has neither red nor blue P 3, then A f(k 2). Proof. Let τ be obtained from τ by replacing colors red and blue with a new color, say β / [k]. Then τ is a Gallai (k 1)-coloring of G. We claim that (G[A], τ ) has no monochromatic copy of P 3 in color β. Suppose not. Let x 1, x 2, x 3 A be such that x 1 x 2, x 2 x 3 are colored by color β under τ. Since (G[A], τ) has neither red nor blue P 3, we may assume that x 1 x 2 is colored blue and x 2 x 3 is colored red under τ. Then x 1 x 3 is colored neither red nor blue under τ. But then (G[x 1, x 2, x 3 }], τ) is a rainbow triangle, a contradiction. Thus (G[A], τ ) has no monochromatic copy of P 3 in color β, as claimed. Then (G, τ ) has no monochromatic copy of W 4. By Claim 1 applied to A, τ and color β, we have A f(k 2). Claim 3. Let A V (G) and x, y V (G) \ A. If all the edges between x, y} and A are colored the same color, say blue, under τ, then G[A] contains no blue P 3. Proof. Suppose (G[A], τ) contains a blue copy of P 3 with vertices, say v 1, v 2, v 3 in order. Then G[v 1, x, v 3, y, v 2 }] has a blue copy of W 4, a contradiction. Let x 1, x 2,..., x m V (G) be a maximum sequence of vertices chosen as follows: for each j [m], all edges between x j and V (G) \ x 1, x 2,..., x j } are colored by the same color under τ. Let X := x 1, x 2,..., x m }. Note that X is possibly empty. For each x j X, let τ(x j ) be the unique color on the edges between x j and V (G) \ x 1, x 2,..., x j }. Claim 4. τ(x i ) τ(x j ) for all i, j [m] with i j. Proof. Suppose there exist i, j [m] with i j such that τ(x i ) = τ(x j ). We may assume that the color τ(x i ) is blue, i < j, and x j is the first vertex in the sequence x 1,..., x m such that τ(x j ) = τ(x i ) for some i [m] with i < j. By the pigeonhole principle, j k + 1. Let A := x 1, x 2,..., x j }. By Claim 3, G \ A has no blue P 3. By Claim 1, G\A f(k 1). But then G f(k 1)+k+1 < f(k)+1, a contradiction. By Claim 4, X k. Note that G \ X has no monochromatic copy of W 4 under τ. Consider a Gallai-partition of G\X, as given in Theorem 1.2, with parts V 1, V 2,..., V p, where p 2. We may assume that V 1 V 2... V p. Let R be the the reduced graph of G \ X with vertices a 1,..., a p. By Theorem 1.2, we may assume that every edge of R is colored red or blue. Note that any monochromatic copy of W 4 in R would yield a monochromatic copy of W 4 in G \ X. Thus R has neither red nor blue W 4. 5
6 Since R 2 (W 4 ) = 15, we see that p 14. Then V 1 2 because G \ X 26 for all k 3. Let B := v p i=2 V i v is blue-complete to V 1 under τ} R := v p i=2 V i v is red-complete to V 1 under τ} Then B + R + V 1 = G X. We may assume that B R. By the choice of x 1,..., x m, R 2. By Claim 3, neither (G[V 1 ], τ) nor (G[R], τ) contains a red copy of P 3. Note that (G[V 1 R], τ) has a red copy of C 4. Thus no vertex in X is red-complete to V (G) \ X under τ. Claim 5. (G[B], τ) contains a red copy of P 3. Furthermore, V 1 X f(k 2). Proof. Suppose (G[B], τ) has no red P 3. Then (G[B V 1 X], τ) has no red P 3, because no vertex in X is red-complete to V (G) \ X under τ and (G[V 1 ], τ) has no red P 3. Note that (G[R], τ) has no red P 3. By Claim 1, R f(k 1) and B V 1 X f(k 1). By ( ), 2f(k 1) f(k) for all k 3. But then G = R + B V 1 X 2f(k 1) f(k), a contradiction. Thus (G[B], τ) contains a red copy of P 3 and so B 3. Then no vertex in X is blue-complete to V (G) \ X under τ. By Claim 3, (G[V 1 ], τ) has no blue P 3. Thus (G[V 1 X], τ) contains neither red nor blue P 3. By Claim 2, V 1 X f(k 2), as desired. Claim 6. V 3 1. Proof. Suppose V 1 V 2 V 3 2. Since (G, τ) contains no monochromatic W 4, we see that R[a 1, a 2, a 3 }] is not a monochromatic triangle. Let A 1, A 2, A 3 be a permutation of V 1, V 2, V 3 such that A 2 is, say, blue-complete, to A 1 A 3 in G. Then A 1 must be red-complete to A 3. Let A := V (G) \ (A 1 A 2 A 3 X). Then no vertex in A is red-complete to A 1 A 3, and no vertex in A is blue-complete to A 1 A 2 or A 2 A 3. This implies that A must be red-complete to A 2. Note that every vertex in A is bluecomplete to either A 1 or A 3. Let A := v A v is blue-complete to A 1 under τ}. Then A \ A is blue-complete to A 3 under τ. Note that A 1 is blue-complete to A and A 2 is red-complete to A. By Claim 3, (G[A ], τ) has neither red nor blue P 3. By Claim 2, A f(k 2). Similarly, A \ A f(k 2). By Claim 5, A i f(k 2) X for all i 1, 2, 3}. By ( ), 5f(k 2) f(k) for all k 3. But then G = A + A \ A + A 1 + A 2 + A 3 + X 5f(k 2) 2 X f(k), a contradiction. By Claim 6, V 3 1. By Claim 5, V 1 X f(k 2) and so V 2 f(k 2). By 6
7 ( ) again, 5f(k 2) f(k) for all k 3. But then G = V 1 X + V 2 + V V p 2f(k 2) + (p 2) 2f(k 2) f(k 2) f(k), because p 14 and f(k 2) 4, a contradiction. This completes the proof of Theorem 1.5. Acknowledgements The research of Fangfang Zhang is supported by the Chinese Scholarship Council. References [1] C. Bosse, Z-X. Song, Multicolor Gallai-Ramsey numbers of C 9 and C 11, arxiv: [2] C. Bosse, Z-X. Song, J. Zhang, Improved upper bounds for Gallai-Ramsey numbers of odd cycles, arxiv: [3] D. Bruce, Z-X. Song, Gallai-Ramsey numbers of C 7 with multiple colors, Discrete Mathematics 342 (2019) [4] K. Cameron, J. Edmonds, L. Lovász, A note on perfect graphs, Periodica Mathematica Hungarica 17 (1986) [5] M. Chen, Y. Li, C. Pei, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Graphs and Combinatorics 34 (2018) [6] F. R. K. Chung, R. Graham, Edge-colored complete graphs with precisely colored subgraphs, Combinatorica 3 (1983) [7] R. J. Faudree, B. D. McKay, A Conjecture of Erdős and the Ramsey Number r(w 6 ), Journal of Combinatorial Mathematics and Combinatorial Computing 13 (1993) [8] J. Fox, A. Grinshpun, J. Pach, The Erdős-Hajnal conjecture for rainbow triangles, Journal of Combinatorial Theory, Series B 111 (2015) [9] S. Fujita, C. Magnant, K. Ozeki, Rainbow generalizations of Ramsey theory: a survey, Graphs and Combinatorics 26 (2010) [10] T. Gallai, Transitiv orientierbare Graphen, Acta mathematica Academiae Scientiarum Hungaricae 18 (1967)
8 [11] R. E. Greenwood, A. M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics 7 (1955) 1 7. [12] A. Gyárfás, G. Sárközy, A. Sebő, S. Selkow, Ramsey-type results for Gallai colorings, Journal of Graph Theory 64 (2010) [13] A. Gyárfás, G. Simonyi, Edge colorings of complete graphs without tricolored triangles, Journal of Graph Theory 46 (2004) [14] G. R. T. Hendry, Ramsey numbers for graphs with five vertices, Journal of Graph Theory 13 (1989) [15] J. Körner, G. Simonyi, Graph pairs and their entropies: modularity problems, Combinatorica 20 (2000) [16] H. Lei, Y. Shi, Z-X. Song, J. Zhang, Gallai-Ramsey numbers of C 10 and C 12, preprint, arxiv: [17] X. Li, L. Wang, Gallai-Ramsey numbers for a class of graphs with five vertices, preprint, arxiv: [18] H. Liu, C. Magnant, A. Saito, I. Schiermeyer, Y. Shi, Gallai-Ramsey number for K4, Submitted. [19] Z-X. Song, J. Zhang, A conjecture on Gallai-Ramsey numbers of even cycles and paths, submitted, arxiv: [20] F. Zhang, Y. Chen, Z-X. Song, Gallai-Ramsey numbers of cycles, submitted, arxiv:
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More informationLarge subgraphs in rainbow-triangle free colorings. Adam Zsolt Wagner
Large subgraphs in rainbow-triangle free colorings Adam Zsolt Wagner arxiv:1612.00471v1 [math.co] 1 Dec 2016 Abstract Fox Grinshpun Pach showed that every 3-coloring of the complete graph on n vertices
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More 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 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 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 informationInduced subgraphs of graphs with large chromatic number. IX. Rainbow paths
Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths Alex Scott Oxford University, Oxford, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544, USA January 20, 2017; revised
More informationClosing the gap on path-kipas Ramsey numbers
Closing the gap on path-kipas Ramsey numbers We dedicate this paper to the memory of Ralph Faudree, one of the exponents of Ramsey theory who died on January 13, 2015 Department of Mathematics University
More informationColouring problems related to graph products and coverings
Ph.D. Thesis Booklet Colouring problems related to graph products and coverings Ágnes Tóth Supervisor: Prof. Gábor Simonyi Department of Computer Science and Information Theory Budapest University of Technology
More informationBounds on Shannon Capacity and Ramsey Numbers from Product of Graphs
Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy of Sciences Nanning, Guangxi 530007, China xxdmaths@sina.com and Stanis law P. Radziszowski Department of
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More 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 informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
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 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 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 informationPartitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationNot complementary connected and not CIS d-graphs form weakly monotone families
DIMACS Technical Report 2009-08 March 2009 Not complementary connected and not CIS d-graphs form weakly monotone families by Diogo V. Andrade 1 Google Inc. 76 Ninth Ave, New York, NY, 10011 e-mail: diogo@google.com
More informationMonochromatic tree covers and Ramsey numbers for set-coloured graphs
Monochromatic tree covers and Ramsey numbers for set-coloured graphs Sebastián Bustamante and Maya Stein Department of Mathematical Engineering University of Chile August 31, 2017 Abstract We consider
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationOn exact blockers and anti-blockers, -conjecture, and related problems a
R u t c o r Research R e p o r t On exact blockers and anti-blockers, -conjecture, and related problems a Vladimir Gurvich b RRR 10-2010 (revised RRR-17-2009), May, 2010 RUTCOR Rutgers Center for Operations
More informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More 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 informationNote on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs
Georgia Southern University From the SelectedWorks of Colton Magnant 2011 Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs Shinya Fujita, Gunma National College of Technology
More informationSome Problems in Graph Ramsey Theory. Andrey Vadim Grinshpun
Some Problems in Graph Ramsey Theory by Andrey Vadim Grinshpun Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics
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 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 informationErdős-Gallai-type results for the rainbow disconnection number of graphs
Erdős-Gallai-type results for the rainbow disconnection number of graphs Xuqing Bai 1, Xueliang Li 1, 1 Center for Combinatorics and LPMC arxiv:1901.0740v1 [math.co] 8 Jan 019 Nankai University, Tianjin
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationDegree Ramsey numbers for even cycles
Degree Ramsey numbers for even cycles Michael Tait Abstract Let H s G denote that any s-coloring of E(H) contains a monochromatic G. The degree Ramsey number of a graph G, denoted by R (G, s), is min{
More informationTurán numbers of vertex-disjoint cliques in r-partite graphs
Turán numbers of vertex-disjoint cliques in r-partite graphs Jessica De Silva a,1,, Kristin Heysse b, Adam Kapilow c,, Anna Schenfisch d,, Michael Young e, a University of Nebraska-Lincoln, United States
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 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 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 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 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 informationInduced Graph Ramsey Theory
Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue Chicago, Illinois 60604, USA schaefer@cs.depaul.edu February 27, 2001 Pradyut Shah Department of Computer
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More 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 informationarxiv: v2 [math.co] 25 Jul 2016
Partitioning a graph into a cycle and a sparse graph Alexey Pokrovskiy arxiv:1607.03348v [math.co] 5 Jul 016 ETH Zürich, Zürich, Switzerland Keywords: Partitioning graphs, Ramsey theory, cycles. July 6,
More informationInduced Graph Ramsey Theory
Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue Chicago, Illinois 60604, USA schaefer@csdepauledu June 28, 2000 Pradyut Shah Department of Computer Science
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 informationOn the Regularity Method
On the Regularity Method Gábor N. Sárközy 1 Worcester Polytechnic Institute USA 2 Computer and Automation Research Institute of the Hungarian Academy of Sciences Budapest, Hungary Co-authors: P. Dorbec,
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationGraph Classes and Ramsey Numbers
Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationRainbow Generalizations of Ramsey Theory - A Dynamic Survey
Theory and Applications of Graphs Special Issue: Dynamic Surveys Article 1 2014 Rainbow Generalizations of Ramsey Theory - A Dynamic Survey Shinya Fujita Maebashi Institute of Technology, Maebashi, Japan,
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationCircular Chromatic Numbers of Some Reduced Kneser Graphs
Circular Chromatic Numbers of Some Reduced Kneser Graphs Ko-Wei Lih Institute of Mathematics, Academia Sinica Nankang, Taipei 115, Taiwan E-mail: makwlih@sinica.edu.tw Daphne Der-Fen Liu Department of
More informationNew Results on Generalized Graph Coloring
Discrete Mathematics and Theoretical Computer Science 6, 2004, 215 222 New Results on Generalized Graph Coloring Vladimir E. Alekseev 1 and Alastair Farrugia 2 and Vadim V. Lozin 3 1 Department of Mathematical
More informationTriangle-free graphs with no six-vertex induced path
Triangle-free graphs with no six-vertex induced path Maria Chudnovsky 1, Paul Seymour 2, Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia University, New York, NY 10027 June
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 informationInduced subgraphs of graphs with large chromatic number. III. Long holes
Induced subgraphs of graphs with large chromatic number. III. Long holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationOn Generalized Ramsey Numbers
On Generalized Ramsey Numbers Wai Chee Shiu, Peter Che Bor Lam and Yusheng Li Abstract Let f 1 and f 2 be graph parameters. The Ramsey number rf 1 m; f 2 n is defined as the minimum integer N such that
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 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 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 informationLong Monochromatic Cycles in Edge-Colored Complete Graphs
Long Monochromatic Cycles in Edge-Colored Complete Graphs Linda Lesniak lindalesniak@gmail.com Drew Uniersity and Western Michigan Uniersity May 2012 L. Lesniak (Drew, WMU) Long Monochromatic Cycles May
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 informationStrong edge-colouring of sparse planar graphs
Strong edge-colouring of sparse planar graphs Julien Bensmail a, Ararat Harutyunyan b, Hervé Hocquard a, Petru Valicov c a LaBRI (Université de Bordeaux), 351 cours de la Libération, 33405 Talence Cedex,
More informationMONOCHROMATIC VS. MULTICOLORED PATHS. Hanno Lefmann* Department of Mathematics and Computer Science Emory University. Atlanta, Georgia 30332, USA
MONOCHROMATIC VS. MULTICOLORED PATHS Hanno Lefmann* Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30322, USA and School of Mathematics Georgia Institute of Technology
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationStar Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
Combinatorics, Probability and Computing (2012) 21, 179 186. c Cambridge University Press 2012 doi:10.1017/s096358311000599 Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ANDRÁS GYÁRFÁS1
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
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 informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationRamsey-nice families of graphs
Ramsey-nice families of graphs Ron Aharoni Noga Alon Michal Amir Penny Haxell Dan Hefetz Zilin Jiang Gal Kronenberg Alon Naor August 22, 2017 Abstract For a finite family F of fixed graphs let R k (F)
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 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 informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationThe 3-rainbow index of graph operations
The 3-rainbow index of graph operations TINGTING LIU Tianjin University Department of Mathematics 300072 Tianjin CHINA ttliu@tju.edu.cn YUMEI HU Tianjin University Department of Mathematics 300072 Tianjin
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 informationMulticolour Ramsey Numbers of Odd Cycles
Multicolour Ramsey Numbers of Odd Cycles JOHNSON, JR; Day, A 2017 Elsevier Inc This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Combinatorial Theory, Series
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 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 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 informationInduced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford,
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
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 informationThe 3-colored Ramsey number of odd cycles
Electronic Notes in Discrete Mathematics 19 (2005) 397 402 www.elsevier.com/locate/endm The 3-colored Ramsey number of odd cycles Yoshiharu Kohayakawa a,1,4 a Instituto de Matemática e Estatística, Universidade
More informationAlmost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets
Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Dániel Gerbner a Nathan Lemons b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hungarian Academy of Sciences, Alfréd Rényi Institute
More informationOn the connectivity of extremal Ramsey graphs
On the connectivity of extremal Ramsey graphs Andrew Beveridge and Oleg Pikhurko Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Abstract An (r, b)-graph is a graph
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 informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
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 informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationAn Exact Formula for all Star-Kipas Ramsey Numbers
Graphs and Combinatorics 017) 33:141 148 DOI 10.1007/s00373-016-1746-3 ORIGINAL PAPER An Exact Formula for all Star-Kipas Ramsey Numbers Binlong Li 1, Yanbo Zhang 3,4 Hajo Broersma 3 Received: June 015
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 informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationSATURATION SPECTRUM OF PATHS AND STARS
1 Discussiones Mathematicae Graph Theory xx (xxxx 1 9 3 SATURATION SPECTRUM OF PATHS AND STARS 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 Jill Faudree Department of Mathematics and Statistics University of
More informationThe Erdős-Hajnal hypergraph Ramsey problem
The Erdős-Hajnal hypergraph Ramsey problem Dhruv Mubayi Andrew Suk February 28, 2016 Abstract Given integers 2 t k +1 n, let g k (t, n) be the minimum N such that every red/blue coloring of the k-subsets
More information