Turán numbers of vertex-disjoint cliques in r-partite graphs
|
|
- Branden Kelley
- 5 years ago
- Views:
Transcription
1 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 b Macalester College, Saint Paul, MN, 55105, United States c University of Washington, United States d Montana State University, United States e Iowa State University, United States Abstract For two graphs G and H, the Turán number ex(g, H) is the maximum number of edges in a subgraph of G that contains no copy of H. Chen, Li, and Tu determined the Turán numbers ex(k m,n, kk ) for all k 1 [5]. In this paper we will determine the Turán numbers ex(k a1,...,a r, kk r ) for all r 3 and k Introduction All graphs considered here are finite, undirected, and simple. Throughout the paper we use the standard graph theory notation (see [3]). In particular, a graph is called a complete r-partite graph if its vertex set can be partitioned into r independent sets V 1,..., V r such that for any i = 1,,..., r every vertex in V i is adjacent to all other vertices in V j, j i. We denote a complete r-partite graph with part sizes V i = n i by K n1,...,n r. For a graph G and a positive integer k we use kg to denote k vertex-disjoint copies of G. Given S V (G), the subgraph of G induced by S will be denoted G[S] and the subgraph G[V (G)\S] will be denoted G\S. For two graphs G and H, G + H is the join of G and H, that is Principal corresponding author addresses: jessica.desilva@huskers.unl.edu (Jessica De Silva), kheysse@macalester.edu (Kristin Heysse), akapilow@uw.edu (Adam Kapilow), annaschenfisch@montana.edu (Anna Schenfisch), myoung@iastate.edu (Michael Young) 1 Research is supported in part by the NSF-GRFP Grant DGE Research was supported in part by the NSA Grant H
2 the graph obtained from G H by adding every edge containing a vertex of G and a vertex of H. For two graphs G and H, the Turán number, or extremal number, ex(g, H) is the maximum number of edges among all H free subgraphs of a host graph G. The study of such numbers began in 1907 when Willem Mantel determined the maximum number of edges in a triangle-free graph on n vertices, i.e. ex(k n, K 3 ). In 1941, this theorem was strengthened by Pál Turán who determined ex(k n, K r ). Since then, the most well-studied host graphs have been the complete graph K n and the complete bipartite graph K m,n. Recent studies of extremal numbers consider the case when the forbidden graph H is made up of several vertex-disjoint copies of some smaller graph (e.g., [4], [9], [7], [11]). In particular, Chen, Li, and Tu determined ex(k m,n, kk ) = m(k 1) for 1 k n m [5]. The focus of this paper is to extend their result to forbidding vertex-disjoint cliques of size r in a complete r-partite graph. Theorem 1 (Main Theorem). For any integers 1 k n 1... n r, ex(k n1,...,n r, kk r ) = n i n j n 1 n + n (k 1). For the lower bound, clearly ((n 1 k + 1)K 1 K k 1,n ) + K n3,...,n r is such a subgraph of K n1,...,n r with the required number of edges and no copy of kk r. This gives the lower bound and the remainder of this paper will work to establish the upper bound. The upper bound is proven by considering two cases: n = n r and n < n r. In the former case, the proof is inductive on n 1 + k with Lemmas and 3 as the base cases. In the latter case, the proof is inductive on the total number of vertices in the host graph.. Main results The proof of Theorem 1 first considers the case when the host graph is almost balanced, that is every part size is the same except the smallest part. This proof requires a double induction and is preceded by the two necessary base cases.
3 Define h k (n 1, n,..., n r ) = n i n j n 1 n + n (k 1). Given two disjoint subsets of the vertex set, A, B V (G), define AB as the graph formed by the set of edges in G incident to a vertex in A and a vertex in B. For ease of notation, given an r-partite graph G with parts V 1,..., V r we let R(G, r) = {{v 1,..., v r } V (G) : v i V i for all i [r]}, that is R(G, r) is the set of all r-tuples of vertices with exactly one vertex from each part. We utilize R(G, r) throughout to facilitate the counting of edges. For S R(G, r) define w(s) = E(G[S]). Note that for S R(G, r) an edge v i v j V i V j is counted in w(s) if and only if both v i and v j are present in S, therefore, summing over all S R(G, r), w(s) = E(V i V j ) n l. (1) Lemma. For 1 n 1 n, l i,j Proof. Suppose G K n1,n,...,n ex(k n1,n,...,n, K r ) = h 1 (n 1, n,..., n ). S R(G, r), w(s) ( r ) 1 and hence w(s) does not contain a copy of K r. Then for all (( ) ) r 1 n 1 n r 1. () 3
4 Subtracting () from (1) yields, 0 r j= E(V 1 V j ) n r + = n 1 n r 3 E(G) + r j= E(V i V j ) n 1 n r 3 E(V 1 V j ) n r 3 (n n 1 ) ( ( ) ) r 1 n 1 n r 3 E(G) + E(G) n ( ) r 1 = n r E(G) n r 1 (n n 1 ) ( r 1 = n r E(G) (r )n 1 n r 1 n r 3 (( r ) n r. (( ) r (( ) r ) 1 n 1 n r 1 (n n 1 ) ) ) 1 n 1 n r 1 ) 1 n 1 n r 1 (( ) ) r 1 n 1 n r 1 Therefore ( ) r 1 E(G) n 1 n (r 1) + n n 1 n = h 1 (n 1, n,..., n ). Lemma 3. For 1 n 1 n, ex(k n1,n,...,n, n 1 K r ) = h n1 (n 1, n,..., n ). Proof. This proof is by induction on n 1. The base case of n 1 = 1 is true for all positive integers n by Lemma. Assume the statement holds for n 1 < n 1 where n 1. Suppose G K n1,n,...,n contains more than h n1 (n 1, n,..., n ) edges and does not contain a copy of n 1 K r. We have E(G) > h n1 (n 1, n,..., n ) > h 1 (n 1, n,..., n ), which implies G contains a copy of K r. Let S R(G, r) such that G[S] = K r. Then E(G\S) h n1 1(n 1 1, n 1,..., n 1), otherwise G\S contains a copy of (n 1 1)K r, and this together with G[S] is a copy of n 1 K r in G. Therefore, E(G) E(G\S) > h n1 (n 1, n,..., n ) h n1 1(n 1 1, n 1,..., n 1) ( ) r = (r 1)(n 1 + (r )n ) + (r 1)n 1. 4
5 Since the number of edges in K n1,n,...,n with a vertex in S is ( ) r (r 1)(n 1 + (r )n ) + (r 1)n, this implies all edges in the host graph containing a vertex in S are present in G. Note that this holds for every S such that G[S] = K r in G. Let u i V i and u j V j with i j, if neither u i nor u j is in S, then u i u j E(G). Otherwise, for v i S V i, let S = (S\{v i }) {u i }. S induces a copy of K r in G and therefore u i u j E(G). Hence G = K n1,n,...,n contains n 1 K r which is a contradiction. We now prove Theorem 1. and thus The proof considers two cases: n = n r and n < n r. The first case is proven using double induction and relies on Lemmas and 3 as the base cases. The second case is proven by induction on the total number of vertices in the host graph. Proof. Let 1 k n 1 n r. Case 1. Assume n = n r, we proceed by induction on n 1 + k. The base case of k = 1 is true for all positive integers n 1 by Lemma and the base case of n 1 = k is true for all positive integers k n 1 by Lemma 3. Assume the statement is true for parameters n 1, k such that n 1 + k < n 1 + k where n 1 > k, and that G K n1,n,...,n does not contain a copy of kk r. We first obtain a lower bound on the number of (not necessarily disjoint) copies of K r in G. Suppose there are exactly q such copies of K r in G, then ( ) (( ) ) r r w(s) q + (n 1 n r 1 q) 1. Recall that this gives, q r j= w(s) = r j= E(V 1 V j ) n r + E(V 1 V j ) n r + E(V i V j ) n 1 n r 3 n 1 n r 1 E(V i V j ) n 1 n r 3, (( ) ) r 1. (3) 5
6 We will use (3) to get an upper bound on E(G) by counting E(G\S). An edge v i v j V i V j is counted in E(G \ S) if and only if v i S and v j S, hence r E(G\S) = E(V 1 V j ) (n 1 1)(n 1)n r + E(V i V j ) (n 1) n 1 n r 3. (4) j= Using (3) and (4), ( E(G\S) + q + n 1 n r 1 (( r )) 1 (n 1) ) r j= + Now for S R(G, r), suppose G[S] is a copy of K r. E(V 1 V j ) n 1 (n 1)n r E(V i V j ) (n 1)n 1 n r = E(G) (n 1)n r n 1. (5) Then E(G\S) h k 1 (n 1 1, n 1,..., n 1) else by induction G\S contains a copy of (k 1)K r and so this together with G[S] yields a copy of kk r in G. If G[S] is not complete, then since G\S does not contain a copy of kk r induction gives E(G\S) h k (n 1 1, n 1,..., n 1). Hence E(G \ S) q ( h k 1 (n 1 1, n 1,..., n 1) ) + (n 1 n r 1 q) ( h k (n 1 1, n 1,..., n 1) ) = q(1 n ) + n 1 n r 1 (h k (n 1 1, n 1,..., n 1)) and thus, using (5), we have ( (( E(G) (n 1)n r n 1 n 1 n r 1 r ) ) h k (n 1 1, n 1,..., n 1) + 1 (n 1). ) Therefore E(G) n n 1 ( h k (n 1 1, n 1,..., n 1) + = h k (n 1, n, n,..., n ). (( ) ) ) r 1 (n 1) Case. Assume n < n r, we proceed by induction on the number of total vertices. The base case of n 1 = n r is true for all positive integers k by Case 1. Assume the statement holds for all parameters n 1,..., n r such that r i=1 n i < 6
7 r i=1 n i. Suppose G K n1,...,n r does not contain a copy of kk r. Let v r V r, the graph G\{v r } does not contain a copy of kk r, has fewer vertices than G, and n n r 1. Therefore E(G) = E(G \ {v r }) + d(v r ) ex(k n1,...,n r 1, kk r ) + d(v r ) = h k (n 1,..., n r 1) + d(v r ) = r 1 n i n j n i n 1 n + n (k 1) + d(v r ) i=1 = h k (n 1, n,..., n r ). n i n j n 1 n + n (k 1) 3. Concluding remarks The main theorem relies on the fact that both K r and K n1,n,...,n r are r- partite. Certainly the host graph must be l-partite for l r to have K r as a subgraph. An interesting generalization would be to calculate ex(k n1,n,...,n l, kk r ) for r < l. In [6], De Silva, Heysse, and Young proved that ( l ) ex(k n1,n,...,n l, kk ) = (k 1) n i, i= however the Turán number is open for r 3. The graph ((n 1 + n k + 1)K 1 K k 1,n3 ) + n 4 K 1 does not contain kk 3, hence ex(k n1,n,n 3,n 4, kk 3 ) (n 1 + n + n 3 )n 4 + (k 1)n 3. This construction can be easily generalized to r-partite graphs, but it is not clear that this is an extremal construction. 7
8 We also note that many of the results cited in this paper were originally considered in conjunction with the rainbow number rb(g, H). For a graph G and subgraph H, rb(g, H) is the minimum number of colors required to ensure that every edge coloring of G with rb(g, H) colors has a rainbow copy of H (where a subgraph is rainbow if it has no two edges with the same color). Often the rainbow number is proven via the analogous Turán number, and it would be interesting to see this work extended to the rainbow number rb(k n1,...,n r, kk r ). 4. References [1] H. Bielak, S. Kieliszek, The Turán number of the graph 3P 4, Annales Universitatis Mariae Curie-Sklodowska, sectio A Mathematica 68 (1) (014) 1 9. [] H. Bielak, S. Kieliszek, The Turán number of the graph P 5, Discuss. Math. Graph Theory 36 (3) (016) [3] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London, 1976, Elsevier, New York. [4] N. Bushaw, N. Kettle, Turán numbers of multiple paths and equibipartite forests, Combinatorics, Probability and Computing, 0 (011) [5] H. Chen, X. Li, J. Tu, Complete solution for the rainbow numbers of matchings, Discrete Math. 309 (10) (009) [6] J. De Silva, K. Heysse, M. Young, Rainbow number for matchings in r- partite graphs, preprint. [7] I. Gorgol, Turán numbers for disjoint copies of graphs, Graphs and Comb. 7 (5) (011) [8] X. Li, J. Tu, Z. Jin, Bipartite rainbow numbers of matchings, Discrete Math. 309 (009)
9 [9] B. Lidický, H. Liu, C. Palmer, On the Turán number of forests, Electr. J. Comb. 0 () (01) #P6. [10] L-T. Yuan, X-D. Zhang, Turán numbers for disjoint paths, arxiv: [11] L-T. Yuan, X-D. Zhang, The Turán number of disjoint copies of paths, Discrete Math. 340 () (017)
Monochromatic 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 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 informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
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 informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
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 informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationA lower bound on the order of the largest induced linear forest in triangle-free planar graphs
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs François Dross a, Mickael Montassier a, and Alexandre Pinlou b a Université de Montpellier, LIRMM b Université
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 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 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 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 informationA note on Gallai-Ramsey number of even wheels
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
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
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 informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
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 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 informationZero forcing propagation time on oriented graphs
Zero forcing propagation time on oriented graphs Adam Berliner a, Chassidy Bozeman b, Steve Butler b,, Minerva Catral c, Leslie Hogben b,d, Brenda Kroschel e, Jephian Chin-Hung Lin b, Nathan Warnberg f,
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 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 informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
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 informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
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 informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
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 informationMinimum degree conditions for the existence of fractional factors in planar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(3) (2018), Pages 536 548 Minimum degree conditions for the existence of fractional factors in planar graphs P. Katerinis Department of Informatics, Athens
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationCHVÁTAL-ERDŐS CONDITION AND PANCYCLISM
Discussiones Mathematicae Graph Theory 26 (2006 ) 335 342 8 9 13th WORKSHOP 3in1 GRAPHS 2004 Krynica, November 11-13, 2004 CHVÁTAL-ERDŐS CONDITION AND PANCYCLISM Evelyne Flandrin, Hao Li, Antoni Marczyk
More informationHavel Hakimi residues of unigraphs
Havel Hakimi residues of unigraphs Michael D. Barrus 1 Department of Mathematics, Black Hills State University, Spearfish, SD 57799 Abstract The residue r(g) of a graphgis the number of zerosleft after
More informationDegree Sum Conditions and Vertex-Disjoint Cycles in a Graph
Degree Sum Conditions and Vertex-Disjoint Cycles in a Graph Shinya Fujita Hajime Matsumura Department of Mathematics Keio University Yokohama 223-8522, Japan shinyaa@comb.math.keio.ac.jp musimaru@comb.math.keio.ac.jp
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
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 informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS
ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS MATTHIAS BECK, DANIEL BLADO, JOSEPH CRAWFORD, TAÏNA JEAN-LOUIS, AND MICHAEL YOUNG Abstract. A mixed graph is a graph with directed edges, called arcs, and
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 informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationCounting independent sets of a fixed size in graphs with a given minimum degree
Counting independent sets of a fixed size in graphs with a given minimum degree John Engbers David Galvin April 4, 01 Abstract Galvin showed that for all fixed δ and sufficiently large n, the n-vertex
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 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 informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationA well-quasi-order for tournaments
A well-quasi-order for tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 June 12, 2009; revised April 19, 2011 1 Supported
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
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 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 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 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 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 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 informationarxiv: v1 [math.co] 1 Dec 2013
MINIMAL PANCYCLICITY SEAN GRIFFIN DARTMOUTH COLLEGE arxiv:131.074v1 [math.co] 1 Dec 013 Abstract. A pancyclic graph is a simple graph containing a cycle of length k for all 3 k n. Let m(n) be the minimum
More informationCycle decompositions of the complete graph
Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London
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 informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
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 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 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 informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
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 informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationAn exact Turán result for tripartite 3-graphs
An exact Turán result for tripartite 3-graphs Adam Sanitt Department of Mathematics University College London WC1E 6BT, United Kingdom adam@sanitt.com John Talbot Department of Mathematics University College
More 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 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 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 informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationSolution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions
Noname manuscript No. (will be inserted by the editor) Solution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions Bo Ning Shenggui Zhang Binlong Li Received: date
More informationT -choosability in graphs
T -choosability in graphs Noga Alon 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. and Ayal Zaks 2 Department of Statistics and
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 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 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 informationAn explicit construction for a generalized Ramsey problem
n explicit construction for a generalized Ramsey problem hruv Mubayi June 27, 2002 bstract n explicit coloring of the edges of K n is constructed such that every copy of K 4 has at least four colors on
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
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 informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
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 informationEven Pairs and Prism Corners in Square-Free Berge Graphs
Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul
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 informationGraph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Graph Theory Graph G = (V, E). V ={vertices}, E={edges}. a b c h k d g f e V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} E =16. Digraph D = (V, A). V ={vertices}, E={edges}.
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
More informationResearch Statement. Shanise Walker
Research Statement Shanise Walker Extremal combinatorics is a field at the heart of mathematics. It studies how large or small certain parameters of discrete structures can be if other parameters are given.
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 informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
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 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 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 informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationExtremal H-colorings of trees and 2-connected graphs
Extremal H-colorings of trees and 2-connected graphs John Engbers David Galvin June 17, 2015 Abstract For graphs G and H, an H-coloring of G is an adjacency preserving map from the vertices of G to the
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More information