CONDITIONS FOR THE EXISTENCE OF HAMILTONIAN CIRCUITS IN GRAPHS BASED ON VERTEX DEGREES
|
|
- Brooke Newman
- 6 years ago
- Views:
Transcription
1 CONDITIONS FOR THE EXISTENCE OF HAMILTONIAN CIRCUITS IN GRAPHS BASED ON VERTEX DEGREES AHMED AINOUCHE AND NICOS CHRISTOFIDES 1. Introduction The terminology used in this paper is that of [7]. The term graph denotes a finite, undirected graph without loops or multiple edges. For any vertex x e V of a graph G = (V, E) let N(x) be the set of vertices adjacent to x, and let d{x) be the degree of x. For any two non-adjacent vertices a and b we associate the vertex set T = V {a, b} N(a) U N(b), and if necessary to avoid confusion we shall write T ab instead of T. Also let X ab = \ N(a) n N(b). We denote a(g) as the independence number of G. Let d 1 ^ d 2 <... ^ d n be the degree sequence in V, and let df ^ d$ ^... ^ d^w\ be the degree sequence of vertices in a subset W <= V, where all degrees are with respect to the graph G. A subset W of V is defined to be a 'good' subset in G if d$ > i for all w t e W. Clearly W\ ^ n 2, and every subset of a 'good' subset is a 'good' subset. A non-hamiltonian graph G is maximal if the addition of any edge transforms the graph into a hamiltonian one. The following proposition will be useful. PROPOSITION. Let W be a 'good' subset of V and q ^ n. In any graph G = (V, E) the following conditions (a) and (b) are equivalent. There exists an ordering x x, x 2,..., x n of the vertices of G such that Proof. (a)=>(b) The vertices in W are labelled w x,w 2,...,w\ w \, so that ^df^... ^af wl ; set x t = w t (i = 1, 2,..., W\). Now clearly d{x t ) ^ i and j) <j imply that x {, x } $ W; therefore it follows from (a) that jc f x^e implies that (b)=>(a) Let JC 15..., x n be an ordering which satisfies (b). Let / be the smallest index for which d(x t ) ^ / and given this /, lety be the smallest index satisfying (b). Then, clearly W ={x h \h <j,h^ i) is a 'good' subset and from (b), we have that d( Xi )+d( Xj ) > q. 2. Main results THEOREM 1. Let G = (V, E) be a graph and let W be a 'good' subset of V. If d(a) + d(b) ^ nfor any two non-adjacent vertices a, b in V W, then G is hamiltonian. Received 20 May 1982; revised 12 December 1983 and 20 March Mathematics Subject Classification 05C45. This work was partly supported by the SERC. /. London Math. Soc. (2) 32 (1985) JLM 32
2 386 AHMED AINOUCHE AND NICOS CHRISTOFIDES Proof. Let H be a maximal non-hamiltonian graph satisfying the condition of Theorem 1. Clearly H is not complete. Let a, b be two non-adjacent vertices, which implies that they are joined by a hamiltonian a-b path fi = aa 2 a 3... a n _ x b in H. We prove that a, b can always be chosen as elements of V W. Suppose, on the contrary, that at least one end point of n, a say, is an element of W. Clearly any vertex of R(a) = {a t a i+1 e N(a)} is a possible end point of a hamiltonian path finishing at b. Thus R(a) s w. Among all these possible end points of n we may assume that d(a) = max xer(a) d(x). This is a contradiction since max^g fl(a) d(x) > R(a) = d(a) by the definition of W. Therefore a, b are elements of V W. In H we have that ab $ E implies that d(a) + d(b) < n. The theorem is then proved by contradiction of the hypothesis. Bermond [4] gave a result which is equivalent to Theorem 1, and can be obtained by using the above proposition. By appropriately choosing W, we can easily derive the well-known theorems of Bondy, Posa, Ore, Erdos-Gallai which can be found in [3]. Note that Chvatal's well-known theorem on hamiltonian graphs [8] neither dominates nor is dominated by Theorem 1. We denote by K v the complete graph on p vertices and by K p its complementary graph composed of/? isolated vertices. We write G x U G 2 for the union of two graphs G x and G 2, and G x + G 2 for the join of the two graphs [7]. In a graph G = (V, E), let H = aa 2 a 3... a n _ t b be a given a-b hamiltonian path, and let r, s be integers such that r = min(k\a k en(b)} and s = max{k\a k en{a)}. Let A = {aj\j < r}, B = {^\j > s} and L = N(a) n N(b). A set : {aj I a j+1 e N(a t ) if j > i, a t _ x e N(a t ) if j ^ 0 of vertices is associated with a vertex a { of //. Note that a t e /?(fl<). THEOREM 2. Le/ G = (V, E) be a maximal non-hamiltonian graph; let W be any 'good' subset of V, and suppose that xy$e If there exists at least one pair a, b of non-adjacent vertices such that d(d) + d(b) ^ n 1, then G is isomorphic to the graph (K P U K q U K t _^) + K t, where p, q, t are positive integers. Proof The vertices of W are labelled w lt w 2,..., W\ W \ so d? < d$ ^... < dj» w \. The non-adjacent vertices a, b are joined by a hamiltonian path // = a l a 2...a n with a = a x,b = a n, since G is maximal. Clearly the set R(b) n N(a) is empty, for otherwise G would contain a hamiltonian circuit. Furthermore, a$r(b) U N(a) and therefore R(b) and N(a) form a partition of V a. Similarly, R(a) and N(b) form a partition of V b. Hence, and the following holds for each vertex a i of fj.: n-\o\ + \T\ = X ab, (1) and a j+l en(a), j I (2) and o, R(a) => a } e N(b). J
3 EXISTENCE OF HAMILTONIAN CIRCUITS IN GRAPHS 387 Moreover, the vertices a r,a 8 are elements of L = N(a)()N(b), A-aczN(a) and B b c N(b) for otherwise (2) would be violated. The next important step consists in proving that T, L form a partition of V-(A U B) and each vertex a t of T implies a^el and a j+1 el. (3) In fact, it suffices to prove that ^ e T implies that a i+1 e L since then, by similarity, fljef implies that a^xel and, given these implications, the sets T,L obviously form a partition of V {A U B) since neither two vertices of L nor two vertices of T are consecutive vertices along //. Let S = {a i et\a i+l $L}. (Note that from (2), a k es implies that a k+1 en(a) and a k+2 en(a).) Suppose that S # 0, for otherwise (3) is proved. We may assume that r > 2, for if r = 2 then the circuit a 2 a 3... a k+1 aa k+2... ba 2 would be hamiltonian (a k es). Hence d(a) ^ 2 + X ab, since at least two vertices a 2, a k are elements of N(a) but not elements of L = N(a) 0 N(b). First, we prove that for all a t et, we have R(a t ) Tf\ W. Assume that the statement is false for some a^e T, and let a f er{aj) n {N(a) U N(b)}. We may assume, without loss of generality, that/>y. Either the circuit if a f N(b), or the circuit aa 2... ty a f+1 a f+2... a n _ x ba f a f _ x... a j+1 a aa 2... ^_ x ba n _ x... a f+1 a t a j+1 if a f en(a), is hamiltonian, and therefore,...a f a ^T foralla f er. (4) From (1) and (4) we get d{a t ) ^ 1 + T\ = X ab for all a t et. As d(a) + d(b) = n-1 and d(a) ^ Aab + 2, we derive d(a^) + d(b) <n 2 for all a t et. This result implies that T' <=,W. More precisely, we have T={w lt w 2,..., w m }, (5) for otherwise, if T contains some vertex w t ew with i>\t\ then max j/et^(.y) > ^1 = ^ab by definition of W. This contradiction proves (5). Secondly, let R = R(a 2 ), R x 0 A and R 2 = R-R v We prove that R 2 T-S and a 2 e W. Assume that this statement is false and let a p er 2 (p > r by definition of R 2 ), and a p $ T. As r > 2, a 3 must be adjacent to a, but then either the circuit if a p e N(b), or the circuit aa 2 a p+1... a n _ t ba p a p _ x...a z a aa p a p _ x...a r ba n _ x...a p+1 a 2 a z...a r _ x a if a p en(a), is hamiltonian. (Recall that A a <= N(a).) Hence R 2 T. Now suppose that there exists k > r such that a k er 2 C\ S. We already know that a k+1 en(a), a k+2 en(a) whenever a k es. Thus there exists an a k+1 -a k+2 -p&th containing the vertices of A since aa r _ x e E. By replacing a k+1 a k+2 with this path in the circuit a r a r+1...a n _ x ba r we get a hamiltonian circuit in G, a contradiction. Therefore R 2 o S = 0 and the following holds: R 2^T-S. (6) It is clear from (2), (6) and the definition of R, that R c R(a), which implies that N(a 2 ) c= N(a). Furthermore at least two vertices a k+1, a k+2 are adjacent to a but not 13-2
4 -388 AHMED AINOUCHE AND NICOS CHRISTOFIDES to a 2. Thus d(a 2 ) ^ d(a)-2 and d(a 2 ) + d(b) < n 2, which implies that a 2 ew. It follows from (5) that there exists an integer j>\t\ such that a 2 = w t. Every vertex of R x can be chosen to be the second vertex along a new hamiltonian a-b path. The new path would be aa g a g _ 1...a 2 a g+1...a r...a n 1 b if a Q er v Therefore we may assume that R^aWand a 2 = w p with j'^\t\ + \R l \. On the one hand, and by definition of W, we get d(a 2 ) > /?J + T\. On the other hand, d(a 2 ) = 1 +1 R x +1R 2 by definition of R x and R 2 ; hence d{a 2 ) <\ + \R x \ + \T\ from (6). This last contradiction proves (3). To complete the proof, note that no edge a u a v with a u ea,a v eb exists in G, for otherwise aa 2... a u a v a v+1... ba v _ x... a u+1 a would be a hamiltonian circuit. By setting A = p, B = q, L = / and by using the fact that N^) c L for all o c e T, which is implied by (3) and (4), it is clear that Gc(^u^U^ H)+^ Tnis g ra P h is obviously non-hamiltonian and the proof is complete. A graph G is called a 1-tough graph [9] if for every proper subset S of V we have w(g S) ^ S\, where w(g S) is the number of components left by the removal of the set S of vertices. COROLLARY 1. Let G be a \-tough graph and let W be any 'good' subset of V. If d(a) + d(b) ~^n I for any two non-adjacent vertices a, b in V W then G is hamiltonian. Proof. This is immediate. COROLLARY 2. graph. If Let x x, x 2,..., x n be any ordering of the vertices of a l-tough then G is hamiltonian. Proof. This is an equivalent form of Theorem 2 by the above proposition. COROLLARY 3. Let G be a maximal non-hamiltonian graph. If i <j, d t ^ /, d i Kj^di + dj ^ n-1, /Proof This is immediate. COROLLARY 4. If for a graph G, i <\{n \)=>d t > i then G is hamiltonian or G (2K p U K t _ x ) + K t, in which case n is odd. Proof. If n is even then Corollary 4 is a well-known result by Posa [12]. If n is odd, the conditions of the corollary are satisfied. The rest of the proof is simple and can be found in [1].
5 EXISTENCE OF HAMILTONIAN CIRCUITS IN GRAPHS 389 COROLLARY 5. Let G = (V, E) be a non-hamiltonian graph. If a\d) + d(b) ^ n 1 for any two non-adjacent vertices a, b, then either (i) Gg(^u KJ + K X (G is not 2-connected), or (ii) G c A^D+ i (n+1) (n is odd). Proof. Set W = 0 in Theorem 2. If T = 0, then we have (i). If T # 0, then it contains vertices with degree greater than %(n 1), in which case a(g) > ^(«+1). On the other hand, G clearly possesses a hamiltonian path and therefore <x(g) ^ («+ 1). Hence a(g) = \(n-\-1) and (ii) holds. It is interesting to consider those graphs satisfying Ore's condition (that is, did) + d(b) ^ n for all non-adjacent vertices a, b) in the light of Theorem 2. The following corollary generalises a result by Lesniak [11]. COROLLARY 6. Let G = (V, E) be a graph satisfying Ore's condition. Then one of the following holds. (For definitions see [3].) (i) G is \-edge hamiltonian, hamiltonian-connected, I-hamiltonian, (ii) (K p U (iii) Kfr^ Proof. The proof is an easy consequence of Theorem 2 and its corollaries. COROLLARY 7. A graph G is hamiltonian if d x > 2 and d 2 =... = d n ^ \(n 1). COROLLARY 8. An h-regular graph is l-edge hamiltonian ifn^ 2h. A generalisation of Theorem 2 concerning maximal circuits is given below. The proof is on similar lines to that of Theorem 2 and can be found in [1]. THEOREM 3. Let G = (V, E) be a l-tough graph and let W be a "good" 1 subset of V. Ifd(a) + d(b) ^ q 1 for any two non-adjacent vertices a, b in V W, where q ^ n, then G contains a circuit of length at least q. A generalisation of a result by Dirac [10] and the well-known theorem by Chvatal [8] is the following. THEOREM 4. Let G = (V, E) be a maximal non-hamiltonian graph. If dj ^j ^ Qp-l) => d n+1^ ^ n-j then G is isomorphic to the graph (K p U K q U K t _^) + K t, where p,q,t integers and q e {1, p). are positive Proof Let the vertices in G be labelled according to an ascending order of their degrees and consider the following cases. (i) dj >j for ally ^ \n 1. In this case, Corollary 4 applies and G is isomorphic to the graph (2K p U K t _ l )-\-K t with p ^ 1, / ^ 1. (ii) d s = s for some s < \n 1. Choose s to be the maximum integer such that d 8 = s. Let V x = {v t / ^ s}, V 2 = { Vi \i^n+l-s}. Clearly V 1 \ = \ V 2 \ = s. We first
6 390 AHMED AINOUCHE AND NICOS CHRISTOFIDES prove that for all v e V 2, d(v) = n \. Assume that the last statement is false and let / be the smallest value index such that v t e V x is not adjacent to some Vj e V 2. Using the conditions of Theorem 4 we have </(ty)+</(y fc ) ^ n for all k ^ s and thus i < s. The vertex v i must then be adjacent to all v k with k > i and thus d(vj) ^ n 1 i. It is clear that {u l5 v 2,..., yj is a 'good' subset since / < s and hence d(vi) > i. Therefore d{v^ + d(v } ) ^ n, which contradicts the assumption that ViV^E, and hence the statement d(v) = n \ for all ye V 2 is true. By setting t = s,p = \V\ \V 1 \ \V 2 \ we see that G is isomorphic to the graph (K p U K t ) + K t, and the proof is now complete. By setting W = 0 in Theorem 2, the following stronger result is obtained. (The proof is given in [1].) THEOREM 5. Let G (V, E) be a 2-connectedmaximal non-hamiltonian graph. If d(a) + d{b) ^ n 2for any two non-adjacent vertices then G is isomorphic to one of the following graphs: n odd, n even, = Aj (n _ a) + (% n _ 2) U K 2 ), n even, = K 2 + 3/LQ, n = Conjectures CONJECTURE 1. Let G be a 1-tough graph let W be any 'good' subset. If d(a) + d(b) + d(c) ^ n for any three mutually non-adjacent vertices a, b, c with a, be V W and c that vertex with the smallest degree (amongst the vertices non-adjacent to a or b), then G is hamiltonian. In [5] the following theorem of Jung is given. IfG is a \-tough graph of order n ^ 11 andd(a) + d(b) ^ n 4for any two non-adjacent vertices a, b then G is hamiltonian. This result would be a simple corollary of Conjecture 1 (in the particular case where W = 0). The conjecture given below generalises and strengthens Theorem 2. CONJECTURE 2. Let G be a l-tough graph and let W be any 'good' subset of V. If d(a) + d(b) ^ q 2 for any two non-adjacent vertices a, b in V W, where q ^n is an integer, then G contains a circuit of length at least q. If true, this conjecture will give the best possible result if q < n. This is clear from the graph G* defined as follows. Take 3 vertex-disjoint cliques of order r $s 2, add a vertex which is joined to every other vertex and three edges xy, yz, zx where x, y, z are three vertices, each one chosen from a different clique. The graph obtained is l-tough. It is easy to check that the maximal circuit has a length 2r+2 = 2d l -\-2.
7 EXISTENCE OF HAMILTONIAN CIRCUITS IN GRAPHS 391 References 1. A. AINOUCHE, 'Connectivity, independent sets and maximal circuits in undirected graphs', Ph.D. Thesis, London University A. AINOUCHE and N. CHRISTOFIDES, 'Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs', J. Combin. Theory Ser. B 31 (1981) C. BERGE, Graphs and hypergraphs (North-Holland, Amsterdam 1973). 4. J. C. BERMOND, 'On Hamiltonian walks', Proceedings of the fifth British combinatorial conference (Bell, Winnipeg 1976) pp B. BOLLOBAS, Extremal graph theory (Academic Press, London 1978). 6. J. A. BONDY and V. CHVATAL, 'A method in graph theory', Discrete Math. 15 (1976) J. A. BONDY and U. S. R. MURTY, Graph theory with applications (MacMillan, London 1975). 8. V. CHVATAL, 'On Hamiltonian ideals', J. Combin. Theory Ser. B 12 (1972) V. CHVATAL, 'Tough graphs and Hamiltonian circuits', Discrete Math. 5 (1973) G. A. DIRAC, 'Note on Hamilton circuits and Hamilton paths', Math. Ann. 206 (1973) L. LESNIAK, 'n-distant Hamiltonian graphs', Utilitas Math. 9 (1976) L. PosA, 'A theorem concerning Hamilton lines', Magyar Tud. Adak. Mat. Kutako Int. Kozl 7 (1962) Department of Management Science Imperial College London SW7 2BX
Antoni 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 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 informationHAMILTONIAN 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 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 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 informationDistance between two k-sets and Path-Systems Extendibility
Distance between two k-sets and Path-Systems Extendibility December 2, 2003 Ronald J. Gould (Emory University), Thor C. Whalen (Metron, Inc.) Abstract Given a simple graph G on n vertices, let σ 2 (G)
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 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 informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
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 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 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 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 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 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 informationM INIM UM DEGREE AND F-FACTORS IN GRAPHS
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 29 (2000), 33-40 M INIM UM DEGREE AND F-FACTORS IN GRAPHS P. K a t e r in is a n d N. T s ik o p o u l o s (Received June 1998) Abstract. Let G be a graph, a,
More informationCYCLES CONTAINING SPECIFIED EDGES IN A GRAPH CYKLE ZAWIERAJĄCE WYBRANE KRAWĘDZIE GRAFU
GRZEGORZ GANCARZEWICZ CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH CYKLE ZAWIERAJĄCE WYBRANE KRAWĘDZIE GRAFU A b s t r a c t The aim of this paper is to prove that if s 1 and G is a graph of order n 4s
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
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 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 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 informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
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 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 informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
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 informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
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 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 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 informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
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 informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationA MATROID EXTENSION RESULT
A MATROID EXTENSION RESULT JAMES OXLEY Abstract. Adding elements to matroids can be fraught with difficulty. In the Vámos matroid V 8, there are four independent sets X 1, X 2, X 3, and X 4 such that (X
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 informationHAMBURGER BEITRÄGE ZUR MATHEMATIK
HAMBURGER BEITRÄGE ZUR MATHEMATIK Heft 8 Degree Sequences and Edge Connectivity Matthias Kriesell November 007 Degree sequences and edge connectivity Matthias Kriesell November 9, 007 Abstract For each
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
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 informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
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 informationImproved degree conditions for 2-factors with k cycles in hamiltonian graphs
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
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 informationThe power graph of a finite group, II
The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke July 6, 008 A non-empty class A of labelled graphs is weakly addable if for each graph G A and any two distinct components
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 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 information1 Hamiltonian properties
1 Hamiltonian properties 1.1 Hamiltonian Cycles Last time we saw this generalization of Dirac s result, which we shall prove now. Proposition 1 (Ore 60). For a graph G with nonadjacent vertices u and v
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 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 informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
More informationbe a path in L G ; we can associated to P the following alternating sequence of vertices and edges in G:
1. The line graph of a graph. Let G = (V, E) be a graph with E. The line graph of G is the graph L G such that V (L G ) = E and E(L G ) = {ef : e, f E : e and f are adjacent}. Examples 1.1. (1) If G is
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More 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 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 informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
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 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 informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationEven pairs in Artemis graphs. Irena Rusu. L.I.F.O., Université d Orléans, bât. 3IA, B.P. 6759, Orléans-cedex 2, France
Even pairs in Artemis graphs Irena Rusu L.I.F.O., Université d Orléans, bât. 3IA, B.P. 6759, 45067 Orléans-cedex 2, France Abstract Everett et al. [2] defined a stretcher to be a graph whose edge set can
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 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 informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
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 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 informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
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 Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
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 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 informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
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 informationMONOCHROMATIC VS. MULTICOLORED PATHS. Hanno Lefmann* Department of Mathematics and Computer Science Emory University. Atlanta, Georgia 30332, USA
MONOCHROMATIC VS. MULTICOLORED PATHS Hanno Lefmann* Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30322, USA and School of Mathematics Georgia Institute of Technology
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke January 8, 007 A non-empty class A of labelled graphs that is closed under isomorphism is weakly addable if for each graph
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
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 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 informationDomination in Cayley Digraphs of Right and Left Groups
Communications in Mathematics and Applications Vol. 8, No. 3, pp. 271 287, 2017 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com Domination in Cayley
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 informationA Fan-Type Condition for Hamiltonian Graphs *
A Fan-Type Condition for Hamiltonian Graphs * Gao Taiping Department of Mathematics, University of Shanxi Taiyuan, Shanxi 030006, People's Republic of China Song Wenjie and Wang Jianzhong Department of
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 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 informationCitation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).
Syddansk Universitet Transversals in 4-uniform hypergraphs Henning, Michael A; Yeo, Anders Published in: Journal of Combinatorics Publication date: 2016 Document version Forlagets udgivne version Document
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 informationTriangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable
Triangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable Maria Chudnovsky Princeton University, Princeton, NJ 08544 Chun-Hung Liu Princeton University, Princeton, NJ 08544
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
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 informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
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 informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
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 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 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 informationNon-trivial intersecting uniform sub-families of hereditary families
Non-trivial intersecting uniform sub-families of hereditary families Peter Borg Department of Mathematics, University of Malta, Msida MSD 2080, Malta p.borg.02@cantab.net April 4, 2013 Abstract For a family
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 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 informationToughness and Vertex Degrees
Toughness and Vertex Degrees D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030, U.S.A. H.J. Broersma School of Engineering and Computing Sciences Durham University
More information