On splitting digraphs
|
|
- Gyles Flowers
- 5 years ago
- Views:
Transcription
1 On splitting digraphs arxiv: v [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 of Applied Mathematics, Northwestern Polytechnical University, Xi an, 7007, P. R. China Abstract In 995, Stiebitz asked the following question: For any positive integers s,t, is there a finite integer f(s,t) such that every digraph D with minimum out-degree at least f(s,t) admits a bipartition (A, B) such that A induces a subdigraph with minimum out-degree at least s and B induces a subdigraph with minimum out-degree at least t? We give an affirmative answer for tournaments, multipartite tournaments, and digraphs with bounded maximum in-degrees. In particular, we show that for every ǫ with 0 < ǫ < /, there exists an integer δ 0 such that every tournament with minimum out-degree at least δ 0 admits a bisection (A,B), so that each vertex has at least(/ ǫ) of its out-neighbors in A, and in B as well. Keywords: Bipartitions of digraphs; Tournaments; Weighted Lovász Local Lemma; Introduction Partitioning an undirected graph (a digraph) into two parts under certain constraints (e.g., see [7] for connectivity constraint, see [5] for chromatic number constraint) has been widely studied due to its important applications in induction arguments. Among them, partitions under degree constraints have attracted special attention and a number of classical results in undirected graphs have been achieved. Lovász [] proved in 966 that every undirected graph with maximum degree s t can be partitioned into two parts such that they induce two subgraphs with maximum degree at most s and at most t, respectively. Stiebitz address: dlyang0@63.com. address: bai@nwpu.edu.cn. Corresponding author. address: ghwang@sdu.edu.cn address: jlwu@sdu.edu.cn.
2 [4] showed in 996 that every undirected graph with minimum degree s t can be partitioned into two parts such that they induce two subgraphs with minimum degree at least s and at least t, respectively. A natural question is whether or not the corresponding assertions for digraphs hold, where the degree is replaced by out-degree. For Lovász s result under maximum degree constraint, Alon [] pointed out that its corresponding assertion fails for digraphs in the following strong sense: For every k, there is a digraph without even cycles, in which all out-degrees are exactly k. It is trivial to prove that for every bipartition of such a digraph, the maximum out-degree in one of the two parts is k. This example was given by Thomassen [7] in 985. How about the corresponding assertion for digraphs with respect to Stiebitz s result? In fact, in 995, Stiebitz [3] proposed the following problem. Problem. For any positive integers s,t, is there a finite integer f(s,t) such that every digraph with minimum out-degree at leastf(s,t) admits a bipartition (A,B), so that A induces a subdigraph with minimum out-degree at least s and B induces a subdigraph with minimum out-degree at least t? This problem was also mentioned in []. For general digraphs, the only known value is f(, ) = 3 from a result of Thomassen [6]. Lichiardopol [0] proved that every tournament with minimum out-degree at least t s 3s admits a bipartition (A,B) such that A induces a subdigraph with minimum out-degree at least s and B induces a subdigraph with minimum out-degree at least t. Kézdy [6] constructed an example showing that f(, ) > 5. For more results about splitting digraphs, the readers are referred to [4, 9]. Particularly, we ask for a bipartition (A,B) with A and B of fixed sizes. A bisection is a bipartition (A,B) with A B. Bollobás and Scott [3] conjectured that every graph G has a bisection (A,B) with d H (v) d G(v) for each v V(G), where H is the subgraph induced by the set of edges between A and B. However, Ji et al. [5] gave an infinite family of counterexamples to this conjecture, which indicates that d G(v) is probably the correct lower bound. This conjecture is widely open and readers are referred to [3, 5, 8]. For digraphs, unfortunately, the same example given by Thomassen [7] indicates that we cannot obtain a bipartition (A,B) such that each vertex in one part has at least one outneighbor in the other part. So we begin to consider whether or not there exists a bisection of any digraph such that the two subdigraphs induced by the two parts have high minimum out-degree, and we propose the following problem. Problem. For any positive integers s,t, is there a finite integer f(s,t) such that every digraph with minimum out-degree at least f(s,t) admits a bisection (A,B), so that A induces
3 a subdigraph with minimum out-degree at least s and B induces a subdigraph with minimum out-degree at least t? In this paper, we give affirmative answers to Problems and for some classes of digraphs. Given a digraph D and a bipartition (A,B) of V(D), let (D) be the maximum in-degree of D and e(a,b) be the number of arcs from A to B. Let D[A] and D[B] be the induced subdigraphs of D on A and B, respectively. For a vertex v V(D), we write d A (v) for the number of out-neighbors of v in A, and d B (v) for the number of out-neighbors of v in B. All digraphs considered here are simple (without loops or multiple arcs). An n-partite tournament with n, or multipartite tournament, is an orientation of a complete n-partite graph, and particularly, a tournament is an orientation of a complete graph. A digraph is strong if, for every two vertices x and y, there exists an (x,y)-path. As for tournaments, we have the desired result in the following strong sense. Theorem. For everyǫwith 0 < ǫ <, there exists an integerδ 0 such that every tournament T with δ (T) δ 0 admits a bisection (A,B) with min{d A (v),d B (v)} ( ǫ)d T (v) for every v V(T). This result gives affirmative answers to Problems and for tournaments. A digraph with minimum out-degree s is s-minimal if any proper subdigraph has minimum out-degree at most s. It is not hard to prove that any s-minimal tournament T with s > 0 is strong. So we have the following result. Corollary. For every ǫ with 0 < ǫ <, there exists an integer δ 0 such that every tournament T with δ (T) δ 0 admits a bipartition (A,B) such that T[A] is strong and d A (v) ( ǫ)d T (v) for every v A, d B (v) ( ǫ)d T (v) for every v B. In fact, we can start with a bisection(a,b) from Theorem, such thatmin{d A (v),d B (v)} ( ǫ)d T (v) for every v V(T). By moving vertices from A to B, we have a minimal subset A A such that d A (v) ( ǫ)d T (v) for every v A. Clearly, T[A ] is strong and d B (v) ( ǫ)d T (v) for every v B = V(T)\A. By the weighted Lovász Local Lemma [], we have the following theorem. Theorem. For every 0 < ǫ <, there exists an integer δ 0 such that every digraph D with δ (D) δ 0 and (D) eǫ (δ (D) ) 8δ (D) ( ǫ)d D (v) for every v V(D). admits a bisection (A,B) with min{d A (v),d B (v)} For bipartite tournaments, we also have an affirmative answer to Problem. 3
4 Theorem 3. For any positive integers s t, if D is a bipartite tournament with δ (D) t (s)4 4s s, then D has a bipartition (A,B) with δ (D[A]) s and δ (D[B]) t. For k-partite tournaments with k >, we derive the following result from similar arguments in the proof of Theorem 3, and here we only give a trivial bound. Corollary. For any positive integers s t and k >, if D is a k-partite tournament with δ (D) tmax{s(s),ks(s)}, then D has a bipartition (A,B) with δ (D[A]) s and δ (D[B]) t. Proofs of Theorem, and 3 Proof of Theorem. Let T be such a tournament with n vertices, and assume n is even. We arbitrarily partition the vertices oft into disjoint pairs{v,w },{v,w },...,{v n/,w n/ } (we allow a singleton when n is odd and deal with it in the similar method) and separate each pair independently and uniformly, then we have a bisection (A,B). For a vertex v A (or B) in the pair {v,w}, let X v be the number of out-neighbors of vertex v in A (or B). We say v is bad if either X v < t := ( ǫ)d T (v) or X v > d T (v) t and denote by X the number of bad vertices. For every v V(T), let a v = {i [ n ] : {v i,w i } N (v)} and b v = {i [ n ] : N (v) {v i,w i } = }. Thus we have d T (v) = a v b v and Pr(X v < t) = Pr(X v > d T (v) t) = 0 when a v t. Consider a v < t, we have t a v ( bv )( bv ) w N (v), Pr(X v < t) = t a v ) bv w N (v). Similarly, we have Pr(X v > d T (v) t) = that t av ( bv i t a v ( bv )( ( bv )( bv ) t a v ( bv )( w N (v), ) bv w N (v). If a v < t, then ( b v ) bv ( i)( bv )( ) bv for each i with 0 i t a v, and it follows )( t a bv v ( ) bv )( t a bv ( ). Let f(a,b) = b ) i ( )b, where a < t and 4
5 ab = d T (v). Now we claim that f(a,b) > f(a,b), in fact, ( ) ( b t a ( ) t a b ( ) ) b f(a,b) f(a,b) = 4 i i ( ) b (( ) ( ) ( b b = t a t a ( ) b ( ) (b )!(b ta) = (b ta)!(t a)! > 0, b t a where the last inequality follows from the fact ab > t and a < t. Thus we have t Pr(X v < t) f(0,d T (v)) = ( d T (v) )( ) d T (v) and t Pr(X v > d T (v) t) ( d T (v) )( ) d T (v). )). Suppose a random variable Y has binomial distribution B(N, ), where N = d T (v). By Chernoff s inequality, we know that Pr(Y E(Y) Nσ) < e Nσ for any positive constant σ. Thus we have t ( d T (v) )( ) d T (v) = Pr(Y d T (v) t) = Pr(Y N N t) < e (v) ) ( ) (d T t d T (v) < e ǫ (d T (v) ), where the last inequality follows the fact that t > t > ǫ d T (v) d T (v) whend T (v). ǫ Now we bound E(X). By the linearity of expectation, E(X) = {Pr(X v > d T (v) t)pr(x v < t)} < e ǫ (d T (v) ). v V (T) v V (T) For every i N, the number of vertices v with i d T (v) < i in T is at most i, and there exists a positive integer i 0 such that e ǫ ( i ) i whenever i i 0. Let δ (T) δ 0 := max{ i 0, ǫ }, we have E(X) < i i 0 i e ǫ ( i ) i i 0 i i. 5
6 Thus there is a bisection of T with no bad vertices, and we are done. From the proof of Theorem, we derive the following corollary. Corollary 3. Every tournament T with δ (T) (o())k admits a bisection (A,B) with min{d A (v),d B (v)} k for every v V(T), where the o()-term tends to zero as k tends to infinity. Proof of Theorem. First we introduce a well-known lemma. Lemma. (The Weighted Local Lemma []) Consider a set B = {A,A,...,A n } of events such that each A i is mutually independent of B (D i {A i }) for some D i B. If we have integers t,t,...,t n and a real number 0 p 4 (a) Pr(A i ) p t i and (b) A j D i (p) t j t i, then with positive probability, none of the events in B occur. such that for each i [n], The proof of Theorem relies on Lemma. We arbitrarily partition the vertices of D into disjoint pairs and separate each pair independently and uniformly, then we have a bisection (V,V ). For a vertex v V(D), let x(v) be the number of out-neighbors of v that are in the same part with v. Let A(v) be the event that either x(v) < s := ( ǫ)d D (v) or x(v) > d D (v) s, and let A = {A(v) : v V(D)} be the set of all bad events. By the same argument as in the proof of Theorem, we have Pr(A(v)) = Pr(x(v) < s)pr(x(v) > d D (v) s) < e ǫ (d D (v) ). Let t v := d D (v) δ (D) be the associated weight. Let p := e ǫ (δ (D) ) and p < 4 whenever δ (D) is sufficiently large. In fact, it suffices to have δ (D) δ 0 := min{δ : e ǫ (δ ) < 4,eǫ (δ ) /8δ δ}. Now it suffices to check that conditions (a) and (b) hold. The condition (a) holds, since Pr(A(v)) < e ǫ (d D (v) ) e ǫ (δ (D) )d D (v)/δ (D) = p tv. Let D(v) be the set of events that are relevant to the event A(v). Therefore A(v) is mutually independent of A (D(v) {A(v)}). We observe that A(v) and A(u) are related only if u, v have common out-neighbors or have neighbors in the same pair. From the observation, we have D(v) d D (v) (D). Since (D) eǫ (δ (D) ) 8δ (D) we have A(w) D(v) (p) tw A(w) D(v) p e ǫ (δ (D) ) D(v) t v. 6 and t v for every v V(D),
7 Now condition (b) holds, and by Lemma, with positive probability, no bad events in A occur. That is, we have a bisection with s x(v) d D (v) s for every v V(D). This observation completes the proof. Proofs of Theorem 3 and Corollary. Recall that a digraph with minimum out-degree s is s-minimal if any proper subdigraph has minimum out-degree at most s. We have the following rough characterization of minimal bipartite and k-partite tournaments (k > ). Lemma. () Every s-minimal bipartite tournament D satisfies V(D) (s)4 4s. () Every s-minimal k-partite tournament D satisfies V(D) < max{s(s),ks(s)} Proof. Let D = (U, W) be an s-minimal bipartite tournament on n vertices. It follows that for any vertex v V(D), there is an arc uv with d D (u) = s. Define a = {v U : d D (v) = s} and b = {v W : d D (v) = s} and without loss of generality let a b. By the fact above, we have s(ab) ab n (ab) 0. So b s. Thus we have n max{g(a,b) = (s )(a b) ab : b s,a sb}. By monotonicity analysis, the optimal solution (x,y) satisfies x = sy, and it follows that n max{g(sy,y) = (s) y sy : y s} (s)4 4s. For an s-minimal k-partite tournament D = (U,U,...,U k ), we denote a i = {v U i : d D (v) = s} for each i {,,...,k} and assume that a a... a k. Similarly, we have s k a i i= i<j k a i a j n k a i. If a k a i, then s k k a i a a i > 0 by the above inequality. Thus we have a < s and n < ks(s). If a > k k a i, then sa a a i > 0 and it follows that k a i < s. By the fact that for any vertex v V(D), there is an arc uv with d D (u) = s, we have a < s k and n < s(s). So n < max{s(s),ks(s)}. Lemma implies Theorem 3 and Corollary directly. 3 Remark i= a i We want to mention that Alon et al. [] obtained a similar result regarding Theorem, and their work was available on arxiv just before we submit our manuscript. The results in two 7
8 papers are finished independently. 4 Acknowledgements We are very grateful to the reviewers for their useful comments. This work was supported by NSFC (Nos , 6304, 4793), the Foundation for Distinguished Young Scholars of Shandong Province (JQ050), and China Postdoctoral Science Foundation (No. 06M590969). References [] N. Alon, Splitting digraphs, Combinatorics, Probability and Computing, 5 (006) [] N. Alon, J. Bang-Jensen, S. Bessy, Out-colorings of digraphs, arxiv: v. [3] B. Bollobás, A. D. Scott, Problems and results on judicious partitions, Random Structures and Algorithms, (00) [4] J. Hou, S. Wu, G. Yan, On bisections of directed graphs, European Journal of Combinatorics, 63 (07) [5] Y. Ji, J. Ma, J. Yan, X. Yu, On problems about judicious bipartitions of graphs, arxiv: [6] A. Kézdy, f(, ) > 5, Personal communication. [7] D. Kühn, D. Osthus, Partitions of graphs with high minimum degree or connectivity, Journal of Combinatorial Theory, Series B, 88 (003) [8] C. Lee, P. Loh, B. Sudakov, Bisections of graphs, Journal of Combinatorial Theory, Series B, 03 (03) [9] C. Lee, P. Loh, B. Sudakov, Judicious partitions of directed graphs, Random Structures and Algorithms, 48 (06) [0] N. Lichiardopol, Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: Proof for tournaments of a conjecture of Stiebitz, International Journal of Combinatorics, (0). 8
9 [] L. Lovász, On decomposition of graphs, Studia Scientiarum Mathematicarum Hungarica, (966) [] M. Molloy, B. Reed, Graph colouring and probilistic method, volume 3 of Algorithm and Combinatorics. Springer, 00. [3] M. Stiebitz, Decomposition of graphs and digraphs. In: 995 Prague Midsummer Combinatorial Workshop (M. Klazar, Ed.), KAM-DIMATIA Series , pp , Charles University, Prague 995. [4] M. Stiebitz, Decomposing graphs under degree constraints, Journal of Graph Theory, 3 (996) [5] M. Stiebitz, A relaxed version of the Erdős-Lovász Tihany conjecture, Journal of Graph Theory, 85 (07) [6] C. Thomassen, Disjoint cycles in digraphs, Combinatorica, 3 (983) [7] C. Thomassen, Even cycles in digraphs, European Journal of Combinatorics, 6 (985)
Out-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
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 decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More 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 informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
More 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 informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationInduced subgraphs 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 informationarxiv: v2 [math.co] 10 May 2016
The asymptotic behavior of the correspondence chromatic number arxiv:602.00347v2 [math.co] 0 May 206 Anton Bernshteyn University of Illinois at Urbana-Champaign Abstract Alon [] proved that for any graph
More 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 informationarxiv: v3 [math.co] 10 Mar 2018
New Bounds for the Acyclic Chromatic Index Anton Bernshteyn University of Illinois at Urbana-Champaign arxiv:1412.6237v3 [math.co] 10 Mar 2018 Abstract An edge coloring of a graph G is called an acyclic
More informationBetter 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 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 informationHAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: APPLICATIONS
HAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: APPLICATIONS DANIELA KÜHN AND DERYK OSTHUS Abstract. In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree
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 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 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 informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
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 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 informationGraphs and Combinatorics
Graphs and Combinatorics (2006) 22:241 249 Digital Object Identifier (DOI) 10.1007/s00373-006-0641-8 Graphs and Combinatorics Springer-Verlag 2006 On n-partite Tournaments with Unique n-cycle Gregory Gutin,
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
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 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 informationON THE STRUCTURE OF ORIENTED GRAPHS AND DIGRAPHS WITH FORBIDDEN TOURNAMENTS OR CYCLES
ON THE STRUCTURE OF ORIENTED GRAPHS AND DIGRAPHS WITH FORBIDDEN TOURNAMENTS OR CYCLES DANIELA KÜHN, DERYK OSTHUS, TIMOTHY TOWNSEND, YI ZHAO Abstract. Motivated by his work on the classification of countable
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
More information1 Notation. 2 Sergey Norin OPEN PROBLEMS
OPEN PROBLEMS 1 Notation Throughout, v(g) and e(g) mean the number of vertices and edges of a graph G, and ω(g) and χ(g) denote the maximum cardinality of a clique of G and the chromatic number of G. 2
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
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 informationDiscrete Mathematics. Kernels by monochromatic paths in digraphs with covering number 2
Discrete Mathematics 311 (2011) 1111 1118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Kernels by monochromatic paths in digraphs with covering
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
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 informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationPacking triangles in regular tournaments
Packing triangles in regular tournaments Raphael Yuster Abstract We prove that a regular tournament with n vertices has more than n2 11.5 (1 o(1)) pairwise arc-disjoint directed triangles. On the other
More informationSolution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs Gregory Gutin Department of Computer Science Royal Holloway University
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 informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry To cite this version: Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks
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 a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationLecture 24: April 12
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 24: April 12 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
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 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 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 informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
More informationPaths, cycles, trees and sub(di)graphs in directed graphs
Paths, cycles, trees and sub(di)graphs in directed graphs Jørgen Bang-Jensen University of Southern Denmark Odense, Denmark Paths, cycles, trees and sub(di)graphs in directed graphs p. 1/53 Longest paths
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh Benny Sudakov Abstract An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(g) denote
More informationOn the ascending subgraph decomposition problem for bipartite graphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 46 (2014) 19 26 www.elsevier.com/locate/endm On the ascending subgraph decomposition problem for bipartite graphs J. M.
More informationArc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree S. Bessy and F. Havet, Projet Mascotte, CNRS/INRIA/UNSA, INRIA Sophia-Antipolis, 2004 route des Lucioles
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 informationarxiv: v2 [math.co] 6 Sep 2016
Acyclic chromatic index of triangle-free -planar graphs Jijuan Chen Tao Wang Huiqin Zhang Institute of Applied Mathematics Henan University, Kaifeng, 475004, P. R. China arxiv:504.06234v2 [math.co] 6 Sep
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 informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationMaximizing the number of independent sets of a fixed size
Maximizing the number of independent sets of a fixed size Wenying Gan Po-Shen Loh Benny Sudakov Abstract Let i t (G be the number of independent sets of size t in a graph G. Engbers and Galvin asked how
More informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
More informationGallai-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 informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
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 informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationSize and degree anti-ramsey numbers
Size and degree anti-ramsey numbers Noga Alon Abstract A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-ramsey number of H, denoted
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationConnectivity of local tournaments
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (01) Pages 71 79 Connectivity of local tournaments Yubao Guo Andreas Holtkamp Sebastian Milz Lehrstuhl C für Mathematik RWTH Aachen University 5056 Aachen
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 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 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 informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationGraph Packing - Conjectures and Results
Graph Packing p.1/23 Graph Packing - Conjectures and Results Hemanshu Kaul kaul@math.iit.edu www.math.iit.edu/ kaul. Illinois Institute of Technology Graph Packing p.2/23 Introduction Let G 1 = (V 1,E
More 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 informationarxiv: v1 [math.co] 29 Apr 2016
Sufficient conditions for hamiltonian cycles in bipartite digraphs Samvel Kh. Darbinyan Institute for Informatics and Automation Problems, Armenian National Academy of Sciences E-mail: samdarbin@ipia.sci.am
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 informationOre s Conjecture on color-critical graphs is almost true
Ore s Conjecture on color-critical graphs is almost true Alexandr Kostochka Matthew Yancey November 1, 018 arxiv:109.1050v1 [math.co] 5 Sep 01 Abstract A graph G is k-critical if it has chromatic number
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More 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 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 informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More information16 February 2010 Draft Version
Local Tournaments with the minimum number of Hamiltonian cycles or cycles of length three Dirk Meierling Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany e-mail: meierling@math2.rwth-aachen.de
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 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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationOn directed versions of the Corrádi-Hajnal Corollary
On directed versions of the Corrádi-Hajnal Corollary Andrzej Czygrinow H. A. Kierstead heodore Molla October 4, 01 Abstract For k N, Corrádi and Hajnal proved that every graph G on k vertices with minimum
More informationDetermining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments
Determining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments Alex Beckwith Department of Mathematics, Kenyon College, Gambier, Ohio Aleesha Moran
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 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 informationGraphs & Algorithms: Advanced Topics Nowhere-Zero Flows
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called
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 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 informationFractal property of the graph homomorphism order
Fractal property of the graph homomorphism order Jiří Fiala a,1, Jan Hubička b,2, Yangjing Long c,3, Jaroslav Nešetřil b,2 a Department of Applied Mathematics Charles University Prague, Czech Republic
More informationSZEMERÉDI S REGULARITY LEMMA 165
SZEMERÉDI S REGULARITY LEMMA 165 9.4 SZEMERÉDI S REGULARITY LEMMA In this section we describe a fundamental result, the Regularity Lemma, proved by Endre Szemerédi in the 70s. The original motivation for
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 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 informationList-coloring the Square of a Subcubic Graph
List-coloring the Square of a Subcubic Graph Daniel W. Cranston University of Illinois Urbana-Champaign, USA Seog-Jin Kim Konkuk University Seoul, Korea February 1, 2007 Abstract The square G 2 of a graph
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationLarge Cliques and Stable Sets in Undirected Graphs
Large Cliques and Stable Sets in Undirected Graphs Maria Chudnovsky Columbia University, New York NY 10027 May 4, 2014 Abstract The cochromatic number of a graph G is the minimum number of stable sets
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 information