Improved degree conditions for 2-factors with k cycles in hamiltonian graphs
|
|
- Marsha Jones
- 5 years ago
- Views:
Transcription
1 Improved degree conditions for -factors with k cycles in hamiltonian graphs Louis DeBiasio 1,4, Michael Ferrara,, Timothy Morris, December 4, 01 Abstract In this paper, we consider conditions that ensure a hamiltonian graph has a -factor with exactly k cycles. Brandt et al. proved that if G is a graph on n 4k vertices with minimum degree at least n, then G contains a -factor with exactly k cycles; moreover this is best possible. Faudree et al. asked if there is some c < 1 such that δ(g) cn would imply the existence of a -factor with k-cycles under the additional hypothesis that G was hamiltonian. This question was answered in the affirmative by Sárközy, who used the regularity blow-up method to show that there exists some ε > 0 such that for every k 1 and large n, δ(g) ( 1 ε) n suffices. We improve on this result, giving an elementary proof that for every ε > 0 and k 1, if G is a hamiltonian graph on n k ε vertices with δ(g) ( + ε) n, then G contains a -factor with k cycles. Keywords: -factor, hamiltonian cycle 1 Introduction A -factor of a graph G is a spanning -regular subgraph or, alternatively is a collection of disjoint cycles that spans G. As a hamiltonian cycle is a -factor with precisely one component, the problem of determining when a graph G has a -factor is a natural and well-studied relaxation of the hamiltonian problem. A number of results concerning the existence of -factors, along with many related cycle and factorization problems, can be found in [1, 8, 9, 1]. It has been demonstrated a number of times that established sufficient conditions for the existence of some cycle-structural property can be relaxed if the graphs under consideration are also assumed to be hamiltonian. For instance, in [] Amar et al. proved that the minimum degree threshold for pancyclicity in general graphs from [] can be significantly lowered in (necessarily nonbipartite) hamiltonian graphs. 1 Department of Mathematics, Miami University; debiasld@miamioh.edu Dept. of Mathematical and Statistical Sciences, Univ. of Colorado Denver; {michael.ferrara, timothy.morris}@ucdenver.edu Research supported in part by Simons Foundation Collaboration Grant # Research supported in part by Simons Foundation Collaboration Grant #407. 1
2 Theorem 1. If G is a hamiltonian graph of order n and and δ(g) n+1, then G is either pancyclic or bipartite. In [4], Brandt et al. proved the following. Theorem. If k 1 is an integer and G is a graph of order n 4k such that δ(g) n, then G contains a -factor with exactly k cycles. In fact, it was shown that the weaker Ore-type degree condition σ (G) n suffices in place of the given assumption on the minimum degree. Motivated by Theorems 1 and, Faudree et al. proved the following result in [6]. Theorem. If G is a hamiltonian graph of order n 6 and δ(g) 1n +, then G contains a -factor with two components. In [14], Pfender showed that under the additional assumption that G is claw-free, the minimum degree threshold in Theorem can be greatly reduced to δ(g) 7, which is sharp. Theorem inspired the following conjecture, which also appeared in [6]. Conjecture 1. For each integer k there exists a positive real number c k < 1 and integers a k and n k such that every hamiltonian graph G of order n > n k with δ(g) c k n + a k contains a -factor with k cycles. Conjecture 1 was affirmed by Sárközy [17] using the regularity blow-up method. Theorem 4. There exists a real number ε > 0 such that for every integer k there exists an integer n 0 = n 0 (k) such that every hamiltonian graph G of order n n 0 with δ(g) (1/ ε)n has a -factor with k components. Sárközy s result raises a natural question: what is the minimum δ = δ(k, n) such that every hamiltonian graph of order n with minimum degree at least δ has a -factor with exactly k cycles. In 01, Győri and Li announced [10] that they have shown δ ( 11 + ε) n suffices for n sufficiently large. Our main result is the following improvement of Theorem, Theorem 4, and that result. Theorem. Let k 1 and 0 < ε < If G is a hamiltonian graph on n k ε vertices with δ(g) ( + ε) n, then G contains a -factor with exactly k cycles. Additionally, our proof uses only elementary techniques, and hence requires a significantly smaller bound on n than that required by Theorem 4. One vexing aspect of Conjecture 1 and the related work described here is that it is possible that a sublinear, or even constant, minimum degree would suffice to ensure a hamiltonian graph has a -factor of the desired type. Specifically, while the 4-regular graph obtained by replacing every vertex of a cycle with a copy of K e is an example of a family of hamiltonian graphs that do not contain a -factor with two cycles, currently we know of no example that has δ.
3 Proof of Theorem A key ingredient in our proof is the following lemma of Nash-Williams [1]. For completeness, we provide a brief sketch of the proof using modern terminology. Lemma 1. Let G be a -connected graph on n vertices. If δ(g) =: d n+, then either G has a hamiltonian cycle or α(g) d + 1. Proof (sketch). Choose a longest cycle C in G, which has length at least min{δ(g), G } by a classical result of Dirac []. If some component of G C is a vertex v, then the successors of the neighbors of v on C along with v form an independent set of size at least d + 1. Otherwise, let P be a longest path in G C and suppose that P has length at least 1. Consider the endpoints of P say x 1 and x p ; all of their neighbors are in V (P ) V (C). If v i V (C) is a neighbor of x 1, then x p cannot be adjacent to any of the p vertices preceding v i or the p vertices succeeding v i. Counting edges between {x 1, x p } and C in two ways gives a contradiction. We also need the following well known result of Pósa [16]. Theorem 6. Let G be a graph on n vertices and for all i [n] let S i = {v V (G) : deg(v) i}. If for all 1 i < n 1, S i < i and S (n 1)/ n 1, then G has a hamiltonian cycle. Finally, a convex geometric graph G is a graph whose vertices are embedded in the plane in convex position, and whose edges (subject to the embedding of V (G)) are straight line segments. We will utilize the following extremal result of Kupitz [11] (see [7], Theorem 1.9). Theorem 7. Let G be a convex geometric graph of order n k + 1. If E(G) > (k 1)n, then G contains k pairwise noncrossing edges. We are now ready to prove Theorem. Proof. Let k, 0 < ε < 1 10, and n k ε. Note that this implies k 1 εn. We consider two cases, based on the connectivity of G. Case 1: κ(g) < εn. Let S be a minimum cut-set of G. As G is hamiltonian, we have S < εn and further, since δ(g S) ( + ε) n S > n, G S has exactly two components. Let X and Y be those two components, and suppose without loss of generality that X Y. Note then that n < Y n X < n. (1) Consequently, each pair of adjacent vertices u and v in Y satisfies (N(u) N(v)) Y 4 n Y 4 ( Y ) Y = Y. So we may remove a family T of k vertex-disjoint triangles from Y and set Y = Y \ T T V (T ). Now, let X = {v S : deg(v, X) > εn}, Y = S \ X, G 1 = G[X X ], and G = G[Y Y ]. We now verify that G 1 and G satisfy the conditions of Theorem 6, in which case the hamiltonian cycles in G 1 and G along with T give us the desired -factor with k cycles.
4 First note that by (1), X X n so Y Y n. Now for all y Y, ( ) ( ) deg(y, G ) + ε n deg(y, X) S Y \ Y ε n n > Y, and for all y Y, deg(y, G ) ( ) + ε n X n ( Y Y ) 4 Y Y. These calculations show that S i = for all i < n and S i < n i for all n i Y Y. Likewise, by (1), Y > n and thus X X < n. Now for all x X, and for all x X, deg(x, G 1 ) deg(x, G 1 ) > εn > X ( ) + ε n Y n ( ) X X = X X. These calculations show that S i = for all i < εn and S i < εn i for all εn i X X. Case : κ(g) εn. Suppose first that α(g) < n, and let x 1,..., x k 1 be distinct vertices in V (G). Since ( + ε) n (k 1) > n > α(g), we can iteratively construct a family of k 1 vertex disjoint triangles each consisting of x i and some edge in N(x i ). Let G be the graph obtained by deleting these k 1 triangles. As ( ) δ(g ) + ε n (k 1) > n > α(g) α(g ), and κ(g ), Lemma 1 implies that G is hamiltonian, completing the desired -factor with k cycles. Therefore, we may assume that α(g) n. Let H be a hamiltonian cycle in G and let X = {x 1, x,..., x t } be a largest independent set in G. Assuming that H has an implicit clockwise orientation, for each i [t], let y i be the successor of x i along H and let Y = {y 1, y,..., y t }. Note that since X is independent, X Y =. Let D be an auxiliary directed graph with vertex set V (D) = {(x 1, y 1 ),..., (x t, y t )} such that ((x i, y i ), (x j, y j )) E(D) if and only if x i y j is an edge in G (see (a) and (b) in Figure 1). As each vertex v in G has at least δ(g) (n X Y ) ( + ε) n (n t) neighbors in X Y, and n t, we have that δ + (D) ( + ε ) ( ) ( ) ( ) 1 n (n t) = t ε n t ε t = + ε t. () Thus e(d) ( 1 + ε) t and consequently the number of -cycles in D is at least εt. Finally, let Γ be a convex geometric graph with V (Γ) = V (D) such that {(x i, y i ), (x j, y j )} E(Γ) if and only if {(x i, y i ), (x j, y j )} induces a -cycle in D. By (), e(γ) εt, so Theorem 7 implies that Γ contains at least εt pairwise disjoint edges. These εt εn k pairwise disjoint edges correspond to non-overlapping pairs of consecutive chords on H (as in part (a) of Figure 1), which allow us to split H into a -factor with k cycles, completing the proof 4
5 (a) The hamiltonian cycle H with vertices from X colored white and vertices from Y colored black (b) The auxiliary directed graph D Figure 1 (c) The auxiliary convex geometric graph Γ References [1] J. Akiyama and M. Kano, Factors and Factorizations of Graphs: Proof Techniques in Factor Theory, Lecture Notes in Mathematics Vol. 01, Springer, 011. [] D. Amar, E. Flandrin, I. Fournier and A. Germa, Pancyclism in Hamiltonian Graphs, Discrete Math. 89 (1991), [] J. A. Bondy, Pancyclic graphs I, J. Combin. Theory, Ser. B 11 (1971), [4] S. Brandt, G. Chen, R. Faudree, R. Gould and L. Lesniak, Degree Conditions for -Factors, J. Graph Theory 4 (1997), [] G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. (19), [6] R. Faudree, R. Gould, M. Jacobson, L. Lesniak and A. Saito, A Note on -factors with Two Components, Discrete Math. 00 (00), [7] S. Felsner, Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, Advanced Lectures in Mathematics, Springer, 004. [8] R. Gould, Advances on the Hamiltonian Problem A Survey, Graphs and Combinatorics 19 (00), 7. [9] R. Gould, A look at cycles containing specified elements of a graph, Discrete Math. 09 (009), [10] E. Gyori and H. Li, -factors in Hamiltonian graphs, in preparation. [11] Y. Kupitz, On pairs of disjoint segments in convex position in the plane, Annals Discr. Math. 0 (1984), 0 08.
6 [1] Nash-Williams, C. St. J. A. Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency Studies in Pure Mathematics (Presented to Richard Rado) pp Academic Press, London [1] O. Ore, A Note on Hamilton Circuits, Amer. Math. Monthly, 67 (1960),. [14] F. Pfender, -Factors in Hamiltonian Graphs, Ars Comb. 7 (004), [1] M. Plummer, Graph factors and factorization: : A survey, Discrete Math. 07 (007), [16] L. Pósa, A Theorem Concerning Hamilton Lines, Magyar Tud. Akad. Mat. Kutato Int. Közl., 7 (196), 6. [17] G. Sárközy, On -factors with k cycles, Discrete Math. 08 (008),
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationCycle Spectra of Hamiltonian Graphs
Cycle Spectra of Hamiltonian Graphs Kevin G. Milans, Dieter Rautenbach, Friedrich Regen, and Douglas B. West July, 0 Abstract We prove that every graph consisting of a spanning cycle plus p chords has
More informationCYCLE STRUCTURES IN GRAPHS. Angela K. Harris. A thesis submitted to the. University of Colorado Denver. in partial fulfillment
CYCLE STRUCTURES IN GRAPHS by Angela K. Harris Master of Science, University of South Alabama, 003 A thesis submitted to the University of Colorado Denver in partial fulfillment of the requirements for
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 5,6 and Derrick Stolee 7 Abstract Given
More 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 informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationOn the Pósa-Seymour Conjecture
On the Pósa-Seymour Conjecture János Komlós, 1 Gábor N. Sárközy, 2 and Endre Szemerédi 3 1 DEPT. OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NJ 08903 2 DEPT. OF COMPUTER SCIENCE, WORCESTER POLYTECHNIC
More 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 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 informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 6 and Derrick Stolee 7 Abstract Given k
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
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 informationDegree Conditions for Spanning Brooms
Degree Conditions for Spanning Brooms Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael Jacobson, and Huiqing Liu December 4, 01 Abstract A broom is a tree obtained by subdividing one edge of the star
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael
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 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 informationHamiltonian Cycles With All Small Even Chords
Hamiltonian Cycles With All Small Even Chords Guantao Chen, Katsuhiro Ota, Akira Saito, and Yi Zhao Abstract. Let G be a graph of order n 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian
More informationTough graphs and hamiltonian circuits
Discrete Mathematics 306 (2006) 910 917 www.elsevier.com/locate/disc Tough graphs and hamiltonian circuits V. Chvátal Centre de Recherches Mathématiques, Université de Montréal, Montréal, Canada Abstract
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 informationExtensions of a theorem of Erdős on nonhamiltonian graphs
Extensions of a theorem of Erdős on nonhamiltonian graphs Zoltán Füredi Alexandr Kostochka Ruth Luo March 9, 017 Abstract arxiv:1703.1068v [math.co] 5 Apr 017 Let n, d be integers with 1 d, and set hn,
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 informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
More informationPairs of Forbidden Subgraphs for Pancyclicity
1 / 24 Pairs of Forbidden Subgraphs for Pancyclicity James Carraher University of Nebraska Lincoln s-jcarrah1@math.unl.edu Joint Work with Mike Ferrara, Tim Morris, Mike Santana October 2012 Hamiltonian
More informationarxiv: v1 [math.co] 1 Aug 2013
Semi-degree threshold for anti-directed Hamiltonian cycles Louis DeBiasio and Theodore Molla May 11, 014 arxiv:1308.069v1 [math.co] 1 Aug 013 Abstract In 1960 Ghouila-Houri extended Dirac s theorem to
More informationOre and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets
Ore and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets Michael Dairyko 1,4,5, Michael Ferrara,4,7, Bernard Lidický 1,4,6, Ryan R. Martin 1,4,8, Florian Pfender,4,6,9 and Andrew
More informationBipartite Graph Tiling
Bipartite Graph Tiling Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303 December 4, 008 Abstract For each s, there exists m 0 such that the following holds for
More 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 informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More 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 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 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 informationForbidden Subgraphs for Pancyclicity
1 / 22 Forbidden Subgraphs for Pancyclicity James Carraher University of Nebraska Lincoln s-jcarrah1@math.unl.edu Joint Work with Mike Ferrara, Tim Morris, Mike Santana September 2012 Hamiltonian 2 / 22
More informationPancyclicity in claw-free graphs
Discrete Mathematics 56 (00) 151 160 www.elsevier.com/locate/disc Pancyclicity in claw-free graphs R.J. Gould, F. Pfender Department of Mathematics and Computer Science, Emory University, Atlanta, GA 303,
More informationPancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs
Pancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs Michael Ferrara 1 Silke Gehrke 2 Ronald Gould 2 Colton Magnant 3 Jeffrey Powell 4 November 7, 2012 Abstract A graph G is pancyclic if
More informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationF. Roussel, I. Rusu. Université d Orléans, L.I.F.O., B.P. 6759, Orléans Cedex 2, France
A linear algorithm to color i-triangulated graphs F. Roussel, I. Rusu Université d Orléans, L.I.F.O., B.P. 6759, 45067 Orléans Cedex 2, France Abstract: We show that i-triangulated graphs can be colored
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 informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More 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 informationSpanning 2-trails from degree sum conditions
This is a preprint of an article accepted for publication in the Journal of Graph Theory c 2004(?) (copyright owner as specified in the Journal) Spanning 2-trails from degree sum conditions M. N. Ellingham
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationIndependent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
Journal of Combinatorial Theory, Series B 72, 104109 (1998) Article No. TB971794 Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs Carsten Thomassen Department of Mathematics,
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 informationCYCLES OF GIVEN SIZE IN A DENSE GRAPH
CYCLES OF GIVEN SIZE IN A DENSE GRAPH DANIEL J. HARVEY DAVID R. WOOD Abstract. We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least 4 kr contains k vertex
More informationHAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
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 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 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 informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More 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 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 informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
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 informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
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 informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
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 informationHamiltonian properties of 3-connected {claw,hourglass}-free graphs
Hamiltonian properties of 3-connected {claw,hourglass}-free graphs Zdeněk Ryjáček 1,3,5 Petr Vrána 1,3,5 Liming Xiong 2,4,6 November 10, 2017 Abstract We show that some sufficient conditions for hamiltonian
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationarxiv: v1 [math.co] 1 Oct 2013
Tiling in bipartite graphs with asymmetric minimum degrees Andrzej Czygrinow and Louis DeBiasio November 9, 018 arxiv:1310.0481v1 [math.co] 1 Oct 013 Abstract The problem of determining the optimal minimum
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
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 informationThe Toughness of Cubic Graphs
The Toughness of Cubic Graphs Wayne Goddard Department of Mathematics University of Pennsylvania Philadelphia PA 19104 USA wgoddard@math.upenn.edu Abstract The toughness of a graph G is the minimum of
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationCompatible Hamilton cycles in Dirac graphs
Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov Abstract A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated
More informationOn tight cycles in hypergraphs
On tight cycles in hypergraphs Hao Huang Jie Ma Abstract A tight k-uniform l-cycle, denoted by T Cl k, is a k-uniform hypergraph whose vertex set is v 0,, v l 1, and the edges are all the k-tuples {v i,
More informationPartitioning a graph into cycles with a specified number of chords
Partitioning a graph into cycles with a specified number of chords Shuya Chiba Suyun Jiang Jin Yan arxiv:1808.03893v1 [math.co] 1 Aug 018 Abstract For a graph G, letσ (G) be the minimum degree sum of two
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 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 informationA Short Proof of the Hajnal-Szemerédi Theorem on Equitable Coloring
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Coloring H.A. Kierstead A.V. Kostochka July 26, 2006 1 Introduction An equitable k-coloring of a graph G is a proper k-coloring, for which any
More informationHighly Hamiltonian Graphs and Digraphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-017 Highly Hamiltonian Graphs and Digraphs Zhenming Bi Western Michigan University, zhenmingbi@gmailcom Follow this and
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 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 informationTiling on multipartite graphs
Tiling on multipartite graphs Ryan Martin Mathematics Department Iowa State University rymartin@iastate.edu SIAM Minisymposium on Graph Theory Joint Mathematics Meetings San Francisco, CA Ryan Martin (Iowa
More 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 informationLondon E1 4NS, United Kingdom
PROOF OF THE 1-FACTORIZATION AND HAMILTON DECOMPOSITION CONJECTURES BÉLA CSABA 1, DANIELA KÜHN 2, ALLAN LO 2, DERYK OSTHUS 2 AND ANDREW TREGLOWN 3 1 Bolyai Institute, University of Szeged, H-6720 Szeged,
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 informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationLong cycles in 3-cyclable graphs
Long cycles in 3-cyclable graphs D. Bauer 1 L. McGuire 1 H. Trommel 2 H. J. Veldman 2 1 Department of Mathematical Sciences, Stevens Institute of Technology Hoboken, NJ 07030, USA 2 Faculty of Applied
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 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 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 informationSPANNING TREES WITH A BOUNDED NUMBER OF LEAVES. Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang Sun
Opuscula Math. 37, no. 4 (017), 501 508 http://dx.doi.org/10.7494/opmath.017.37.4.501 Opuscula Mathematica SPANNING TREES WITH A BOUNDED NUMBER OF LEAVES Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang
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 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 informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
More informationOn Hamiltonian cycles and Hamiltonian paths
Information Processing Letters 94 (2005) 37 41 www.elsevier.com/locate/ipl On Hamiltonian cycles and Hamiltonian paths M. Sohel Rahman a,, M. Kaykobad a,b a Department of Computer Science and Engineering,
More informationA Generalization of a result of Catlin: 2-factors in line graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(2) (2018), Pages 164 184 A Generalization of a result of Catlin: 2-factors in line graphs Ronald J. Gould Emory University Atlanta, Georgia U.S.A. rg@mathcs.emory.edu
More informationJacques Verstraëte
2 - Turán s Theorem Jacques Verstraëte jacques@ucsd.edu 1 Introduction The aim of this section is to state and prove Turán s Theorem [17] and to discuss some of its generalizations, including the Erdős-Stone
More 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 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 informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationOn two problems in Ramsey-Turán theory
On two problems in Ramsey-Turán theory József Balogh Hong Liu Maryam Sharifzadeh July 7, 016 Abstract Alon, Balogh, Keevash and Sudakov proved that the (k 1)-partite Turán graph maximizes the number of
More information