Strong Tournaments with the Fewest Hamiltonian Paths
|
|
- Osborn Henderson
- 5 years ago
- Views:
Transcription
1 Strong Tournaments with the Fewest Hamiltonian Paths J. W. Moon and Laura L. M. Yang Department of Mathematical Sciences University of Alberta, Edmonton, Alberta, Canada T6G 2G1 Abstract Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum. 1. Introduction A tournament, or an oriented complete graph, T = T n consists of a set of n nodes 1, 2,..., n such that each pair of distinct nodes i and j is joined by exactly one of the (oriented) arcs ij or ji. If the arc ij is in T we say that i dominates j and write i j. It is known (cf. [1; p. 14], [4; p. 21], [6; p. 173], or [7]) that every tournament T has a Hamiltonian path, i.e., a path that passes through each node T exactly once. Let h(t n ) denote the number of Hamiltonian paths in the tournament T n. Moon [5] gave upper and lower bounds for the minimum value of h(t n ) over all strong tournaments T n, that is, tournaments such that for every ordered pair of nodes i and j, there exists a path from i to j in T n. Busch [2] recently showed that the upper bound given in [5] was the actual value of the minimum. More precisely, he showed that if T n is a strong tournament with n 3 nodes, then h(t n ) f(n), where f(n) equals 3 5 (n 3)/3, 5 (n 1)/3, or 9 5 (n 5)/3, according as n is congruent to 0, 1, or 2 modulo 3. The bound is best possible in the sense that for any n 3 certain strong tournaments T n for which h(t n ) = f(n) are known (see [5]). We define these special tournaments in Section 2 and give a preliminary lemma in Section 3. In Section 4 we refine Busch s argument and show that these known special tournaments are the only tournaments T n for which h(t n ) = f(n). (For definitions not given here or for additional material on tournaments, see, e.g., [1], [4], or [6].) 1
2 2. Special Chains of Nearly-Transitive Tournaments We recall [2] that a tournament T = T n with n ( 3) nodes is nearlytransitive if its nodes can be labelled z 1,..., z n in such a way that z i z j when i < j except that z n z 1. We refer to z 1 and z n as the top and bottom nodes and to the remaining nodes as intermediate nodes. Note that if n = 3 and T is a 3-cycle, then any one of the nodes could be regarded as the top node, but once the choice has been made the next nodes of the cycle would be the intermediate node and the bottom node. If n 4, then the top node, bottom node, and intermediate nodes in a nearly-transitive tournament are uniquely determined. Suppose W and X are two disjoint nearly-transitive tournaments. Let us identify the top node of W with the bottom node of X and add arcs of the form xw for all nodes x and w in X and W (other than the node X and W now have in common). We call the resulting tournament a chain H = H(W, X) of the two nearly-transitive tournaments W and X; the top and bottom nodes of H are the top and bottom nodes of X and W, respectively; the intermediate nodes of H are the intermediate nodes of W and X; and the intersection node of H is the node W and X now have in common. These definitions can be extended to chains of m nearly-transitive tournaments in the obvious way for all m 1 (except that a chain consisting of a single nearly-transitive tournament does not have an intersection node). We sometimes refer to the nearly-transitive subtournaments in such a chain as its links. It is not difficult to see that the number of Hamiltonian paths in a nearly-transitive tournament T n is 2 n and that the number of Hamiltonian paths in a chain is the product of the number of Hamiltonian paths in its links. It is a straightforward exercise (see [5; p. 102]) to verify that if H n is a chain with n ( 3) nodes, then h(h n ) f(n) with equality holding if and only if all the links of H n are of order 4 except for certain exceptional links: when n 0 (mod 3) there is one exceptional link of order 3 and when n 2 (mod 3) either there are two exceptional links of order 3 or there is one of order 5; we call such a chain H n a special chain. 3. A Preliminary Result Lemma. Let T = T n be a strong tournament with n 5 nodes and let R = R r+1 and S = S s+1 be two strong subtournaments of T that have a single node v in common, where r, s > 2 and r + s + 1 = n. If h(t ) = h(r)h(s) (3.1) 2
3 and R and S are both chains of nearly-transitive tournaments then T is also a chain of nearly-transitive tournaments. Before giving the details of the argument, we make some observations and introduce some notation. Busch [2; Lemma 2] showed that for any disjoint paths P and Q in a tournament T, there exists a path [P : Q] containing the nodes of P and Q and no other nodes such that the nodes of P and Q occur in the same order in [P :Q] as they do in P and Q. From this it follows, as he pointed out, that for each pair of Hamiltonian paths of R and S of the form BvA and B va, there exists at least one Hamiltonian path of T of the form [B :B ]v[a:a ]. This implies that h(t ) h(r)h(s). (3.2) This inequality was a key step in Busch s proof of the inequality h(t n ) f(n). Every strong tournament contains a Hamiltonian cycle (cf. [1; p. 16], [3], [4; p. 6], or [6; p. 173]). So we may assume the nodes of T are labelled so that vp 1 p 2... p r v and vq 1 q 2... q s v are Hamiltonian cycles of R and S. Let B i := p i+1... p r and A i := p 1... p i, for 0 i r and where B r and A 0 are the empty paths; let B j and A j be similarly defined with respect to the analogous Hamiltonian path of S. Then B i va i and B j va j are Hamiltonian paths of R and S, for 0 i r and 0 j s; so T has at least one Hamiltonian path of the form [B i :B j ]v[a i :A j ]. We now establish some conclusions that follow from our assumption that strict equality holds in (3.2). Our general approach will be to show that if these conditions did not hold, then either there would be at least two Hamiltonian paths of T of the form [B : B ]v[a : A ], for some pair of Hamiltonian paths BvA and B va of R and S; or there would be at least one Hamiltonian path of T that was not of this form for any pair of Hamiltonian paths of R and S. This would imply that strict equality would not hold in (3.2), bearing in mind its derivation. We formulate these conclusions in the following assertions. Assertion 1. Suppose that T, R, and S are as described above, that h(t ) = h(r)h(s), and that p 1 q 1. Then (a) p i q j, for 1 i r and 1 j s. Furthermore, (b) q 1 q s, and (c) v q s 1. 3
4 Proof of (a). Suppose that q j p i for some i and j, where i, j 1. We may assume that if i > 1, then p k q m for 1 k < i and all m; and that if j > 1, then p i q m for 1 m < j. We will show that this gives rise to a contradiction. There are two cases to consider. Case (i). i 1 and j > 1. We may suppose that p i q 1 and, if i > 1, that p i 1 q 1. So if q j p i, then p 1... p i q 1... q j and p 1... p i 1 q 1... q j p i would be two different [A i : A j ] paths (where it is understood that the second path starts with node q 1 if i = 1). Then there would be at least two Hamiltonian paths of T of the form [B i : B j ]v[a i : A j ]. This would contradict assumption (3.1), in view of the earlier observations. Case (ii). i > 1 and j = 1. We may suppose that p i 1 q 2. If q 1 p i, then q 1 p i... p r vp 1... p i 1 q 2... q s would be a Hamiltonian path of T that was not of the form [B : B ]v[a : A ] for any Hamiltonian paths BvA and B va of R and S; for, B would consist of the single node q 1, but there is no Hamiltonian path of S of the form q 1 va since v q 1. This also leads to a contradiction of assumption (3.1), so conclusion (a) must hold. Proof of (b). We may assume that s 3. We know, from part (a), that p r q s. If q s q 1, then vp 1... p r q s q 1... q s 1 would be a Hamiltonian path of T that was not of the form [B : B ]v[a : A ] for any Hamiltonian paths BvA and B va of R and S; for, A would necessarily be the path q s q 1... q s 1 and B would be empty, but va is not a Hamiltonian path of S since q s v. Thus the assumption that q s q 1 would imply a contradiction of (3.1). This implies conclusion (b). Proof of (c). If q s 1 v, then q 1... q s 1 vp 1... p r q s would be a Hamiltonian path of T that was not of the form [B :B ]v[a:a ] for any Hamiltonian paths BvA and B va of R and S; for B would necessarily be the path q 1... q s 1 and A would consist of the node q s, but B va is not a Hamiltonian path of S since q s v. This contradicts assuumption (3.1), so conclusion (c) must hold. Assertion 2. Suppose the assumptions of Assertion 1 hold. If, in addition, the subtournament S = S s+1 is a chain of nearly-transitive tournaments, then v is the top node of S. Proof of Assertion 2. We may assume that s 3. Since S = S s+1 is a chain of nearly-transitive tournaments, S has a unique Hamiltonian cycle C that proceeds from the bottom node through the intersection nodes if there are any to the top node and then through the intermediate nodes back to the bottom node. We know, from parts (b) and (c) of Assertion 1, that q 1 q s and v q s 1. It is not difficult to see, bearing in mind the definitions of C and S and the assumption that s 3, that these facts preclude v from being an intermediate node or the bottom node. Now suppose the chain S has at least two links and that v is one of its intersection nodes. Let q j denote the top node of S (so q 1,..., q j 1 are the intersection nodes between v and q j ). It follows from the definitions of C 4
5 and S and our labelling conventions that q j q j+2 and q j+1 v. Then q 1... q j q j+2... q s vp 1... p r q j+1 would be a Hamiltonian path of T. (Here we use the fact that p r q j+1, by Assertion 1(a).) But this Hamiltonian path is not of the form [B :B ]v[a:a ] for any Hamiltonian paths BvA and B va of R and S; for A would consist of the single node q j+1, but there is no Hamiltonian path of S of the form B vq j+1 since q j+1 v. Thus the assumption that v is an intersection node is incompatible with assumption (3.1). Therefore, v must be the top node, as asserted. The required Lemma now follows immediately from Assertions 1(a) and 2 and their duals. 4. Main Result Theorem. Let T = T n be a strong tournament with n 3 nodes. Then h(t n ) f(n), with equality holding if and only if T is a special chain of nearly-transitive tournaments. Proof. The only strong tournaments with 3 and 4 nodes are nearlytransitive tournaments; and h(t n ) = f(n) for these tournaments. So we may assume the theorem holds for all strong tournaments with fewer than n nodes, for some n 5. Now consider any strong tournament T n with n nodes. If T n is nearly-transitive then h(t n ) = 2 n f(n), with strict inequality holding when n 6. So we may assume that T n is a strong tournament with n 5 nodes that is not nearly-transitive. Busch [2; Lemma 1] showed that such a tournament contains two non-trivial strong subtournaments R = R r+1 and S = S s+1 with the properties described in the first sentence of the Lemma. Following Busch, we may apply inequality (3.2), (part of) the induction hypothesis, and the definition of f(m) to conclude that h(t n ) h(r)h(s) f(r + 1)f(s + 1) f(n). It remains to determine when equality holds throughout here. It follows from the induction hypothesis that the equality h(r)h(s) = f(r + 1)f(s + 1) holds only if both R and S are special chains of nearlytransitive tournaments. And if h(t n ) = h(r)h(s), then it follows from the Lemma that the tournament T is a chain of nearly-transitive tournaments. The required conclusion now follows from the observation at the end of Section 2. The authors are indebted to a referee for some helpful suggestions. 5
6 References [1] J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer-Verlag London Ltd [2] A. H. Busch, A note on the number of hamiltonian paths in strong tournaments, Electron. J. Comb. 13 (2006), #N3. [3] P. Camion, Chemins et circuits hamiltoniens des graphes complets, C. R. Acad. Sci. Paris 249 (1959), [4] J. W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York, [5] J. W. Moon, The minimum number of spanning paths in a strong tournament, Publ. Math. Debrecen 19 (1972), [6] K. B. Reid and L. W. Beineke, Tournaments, Selected Topics in Graph Theory, L. W. Beineke and R. J. Wilson, (Editors), Academic Press, London, 1978, pp [7] L. Rédei, Ein Kombinatorischer Satz, Acta Litt. Szeged 7 (1934),
Multipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More 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 information16 February 2010 Draft Version
Local Tournaments with the minimum number of Hamiltonian cycles or cycles of length three Dirk Meierling Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany e-mail: meierling@math2.rwth-aachen.de
More informationGraphs and Combinatorics
Graphs and Combinatorics (2006) 22:241 249 Digital Object Identifier (DOI) 10.1007/s00373-006-0641-8 Graphs and Combinatorics Springer-Verlag 2006 On n-partite Tournaments with Unique n-cycle Gregory Gutin,
More informationHamiltonian paths in tournaments A generalization of sorting DM19 notes fall 2006
Hamiltonian paths in tournaments A generalization of sorting DM9 notes fall 2006 Jørgen Bang-Jensen Imada, SDU 30. august 2006 Introduction and motivation Tournaments which we will define mathematically
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More 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 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 informationArc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree S. Bessy and F. Havet, Projet Mascotte, CNRS/INRIA/UNSA, INRIA Sophia-Antipolis, 2004 route des Lucioles
More 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 informationThe existence and uniqueness of strong kings in tournaments
Discrete Mathematics 308 (2008) 2629 2633 www.elsevier.com/locate/disc Note The existence and uniqueness of strong kings in tournaments An-Hang Chen a, Jou-Ming Chang b, Yuwen Cheng c, Yue-Li Wang d,a,
More information2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS
Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More 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 informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
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 informationLandau's Theorem revisited
Landau's Theorem revisited Jerrold R. Griggsl Department of Mathematics, University of South Carolina Columbia, SC 29208, USA K.B. Reid 2 Department of Mathematics, California State University San Marcos
More informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More informationStandard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.
5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered
More informationARC-TRACEABLE TOURNAMENTS. Arthur H. Busch. A thesis submitted to the. University of Colorado at Denver. in partial fulfillment
ARC-TRACEABLE TOURNAMENTS by Arthur H. Busch Bachelor of Arts, University of Washington, 1997 A thesis submitted to the University of Colorado at Denver in partial fulfillment of the requirements for the
More informationRainbow Connection in Oriented Graphs
Rainbow Connection in Oriented Graphs Paul Dorbec a,b, Ingo Schiermeyer c, Elżbieta Sidorowicz d and Éric Sopenaa,b a Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence b CNRS, LaBRI, UMR5800, F-33400 Talence
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationAn Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees Francesc Rosselló 1, Gabriel Valiente 2 1 Department of Mathematics and Computer Science, Research Institute
More informationClaws in digraphs. Amine El Sahili and Mekkia Kouider
Claws in digraphs. Amine El Sahili and Mekkia Kouider Abstract. We study in this paper the existence of claws in digraphs. extend a result of Saks and Sós to the tournament-like digraphs. We 1. Introduction
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 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 informationReachability in K-Colored Tournaments. Adam K. Bland
Reachability in K-Colored Tournaments by Adam K. Bland A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Approved July 2 by the Graduate Supervisory
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More 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 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 informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
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 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 informationDiscrete Mathematics. Kernels by monochromatic paths in digraphs with covering number 2
Discrete Mathematics 311 (2011) 1111 1118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Kernels by monochromatic paths in digraphs with covering
More 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 informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More informationRECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES
Discussiones Mathematicae Graph Theory 20 (2000 ) 39 56 RECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES Blaž Zmazek Department of Mathematics, PEF, University of Maribor Koroška 160, si-2000 Maribor,
More informationDetermining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments
Determining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments Alex Beckwith Department of Mathematics, Kenyon College, Gambier, Ohio Aleesha Moran
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationResearch Article Dicycle Cover of Hamiltonian Oriented Graphs
Discrete Mathematics Volume 2016, Article ID 7942192, 5 pages http://dxdoiorg/101155/2016/7942192 Research Article Dicycle Cover of Hamiltonian Oriented Graphs Khalid A Alsatami, 1 Hong-Jian Lai, 2 and
More informationImbalances in directed multigraphs
Acta Univ. Sapientiae, Mathematica, 2, 2 (2010) 137 145 Imbalances in directed multigraphs S. Pirzada Department of Mathematics, University of Kashmir, Srinagar, India email: sdpirzada@yahoo.co.in U. Samee
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 informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
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 informationMinimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs Gregory Gutin Arash Rafiey Anders Yeo Abstract For digraphs D and H, a mapping f : V (D) V (H) is a homomorphism of D to H if uv A(D) implies
More informationCHAPTER III THE PROOF OF INEQUALITIES
CHAPTER III THE PROOF OF INEQUALITIES In this Chapter, the main purpose is to prove four theorems about Hardy-Littlewood- Pólya Inequality and then gives some examples of their application. We will begin
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationFunctions Definable by Arithmetic Circuits
Functions Definable by Arithmetic Circuits Ian Pratt-Hartmann 1 and Ivo Düntsch 2 1 School of Computer Science, University of Manchester, Manchester M13 9PL, U.K. ipratt@cs.man.ac.uk 2 Department of Computer
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
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 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 informationOn scores in tournaments and oriented graphs. on score sequences in oriented graphs. Also we give a new proof for Avery s
Chapter On scores in tournaments and oriented graphs In this Chapter, we report the results available in literature on score sequences in tournaments and oriented graphs. We obtain many new results on
More informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More informationarxiv: v1 [math.co] 27 Aug 2015
arxiv:1508.06934v1 [math.co] 27 Aug 2015 TRIANGLE-FREE UNIQUELY 3-EDGE COLORABLE CUBIC GRAPHS SARAH-MARIE BELCASTRO AND RUTH HAAS Abstract. This paper presents infinitely many new examples of triangle-free
More informationModels of Computation. by Costas Busch, LSU
Models of Computation by Costas Busch, LSU 1 Computation CPU memory 2 temporary memory input memory CPU output memory Program memory 3 Example: f ( x) x 3 temporary memory input memory Program memory compute
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More information1. Introduction and Basic Definitions
Discussiones Mathematicae Graph Theory 24 (2004 ) 509 527 DIFFERENCE LABELLING OF DIGRAPHS Martin Sonntag Faculty of Mathematics and Computer Science TU Bergakademie Freiberg Agricola Str. 1, D 09596 Freiberg,
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 informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More informationA LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES. 1. Introduction
A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES Y. O. HAMIDOUNE AND J. RUÉ Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
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 information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationAlternating cycles and paths in edge-coloured multigraphs: a survey
Alternating cycles and paths in edge-coloured multigraphs: a survey Jørgen Bang-Jensen and Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract A path or cycle
More informationDEGREE SEQUENCES OF INFINITE GRAPHS
DEGREE SEQUENCES OF INFINITE GRAPHS ANDREAS BLASS AND FRANK HARARY ABSTRACT The degree sequences of finite graphs, finite connected graphs, finite trees and finite forests have all been characterized.
More informationLINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line.
LINEAR SPACES Define a linear space to be a near linear space in which any two points are on a line. A linear space is an incidence structure I = (P, L) such that Axiom LS1: any line is incident with at
More informationFinite groups determined by an inequality of the orders of their elements
Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More information2 Notation and Preliminaries
On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound Ratnesh Kumar Haomin Li epartment of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Abstract We show that
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
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 informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationOn the single-orbit conjecture for uncoverings-by-bases
On the single-orbit conjecture for uncoverings-by-bases Robert F. Bailey School of Mathematics and Statistics Carleton University 1125 Colonel By Drive Ottawa, Ontario K1S 5B6 Canada Peter J. Cameron School
More informationStochastic Shortest Path Problems
Chapter 8 Stochastic Shortest Path Problems 1 In this chapter, we study a stochastic version of the shortest path problem of chapter 2, where only probabilities of transitions along different arcs can
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationIsomorphic Cayley Graphs on Nonisomorphic Groups
Isomorphic Cayley raphs on Nonisomorphic roups Joy Morris Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC. V5A 1S6. CANADA. morris@cs.sfu.ca January 12, 2004 Abstract: The
More informationBi-Arc Digraphs and Conservative Polymorphisms
Bi-Arc Digraphs and Conservative Polymorphisms Pavol Hell Arash Rafiey arxiv:1608.03368v3 [cs.ds] 29 Dec 2016 Abstract We introduce the class of bi-arc digraphs, and show they coincide with the class of
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationarxiv:math/ v1 [math.oa] 9 May 2005
arxiv:math/0505154v1 [math.oa] 9 May 2005 A GENERALIZATION OF ANDÔ S THEOREM AND PARROTT S EXAMPLE DAVID OPĚLA Abstract. Andô s theorem states that any pair of commuting contractions on a Hilbert space
More informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
More information