Hamilton Circuits and Dominating Circuits in Regular Matroids
|
|
- Abraham Marsh
- 5 years ago
- Views:
Transcription
1 Hamilton Circuits and Dominating Circuits in Regular Matroids S. McGuinness Thompson Rivers University June 1, 2012 S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
2 A Brief History Theorem (Dirac, 1952) Let G be a simple graph G of order n 3. If each vertex has degree at least n 2, then G has a Hamilton cycle. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
3 A Brief History Theorem (Dirac, 1952) Let G be a simple graph G of order n 3. If each vertex has degree at least n 2, then G has a Hamilton cycle. A cycle C is a graph G is dominating if every edge has at least one endvertex on C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
4 A Brief History Theorem (Dirac, 1952) Let G be a simple graph G of order n 3. If each vertex has degree at least n 2, then G has a Hamilton cycle. A cycle C is a graph G is dominating if every edge has at least one endvertex on C. Theorem (Nash-Williams, 1971) Let G be a simple 2-connected graph of order n 3. If d G (v) 1 3 (n + 2) for all vertices v, then any longest cycle in G is also a dominating cycle. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
5 Edge-Disjoint Hamilton Circuits This theorem was used to prove: Theorem (Nash-Williams, 1971) Every simple graph on n vertices of minimum degree at least n 2 least 5n 224 edge-disjoint hamilton cycles. contains at This theorem was recently extended. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
6 Edge-Disjoint Hamilton Circuits This theorem was used to prove: Theorem (Nash-Williams, 1971) Every simple graph on n vertices of minimum degree at least n 2 least 5n 224 edge-disjoint hamilton cycles. contains at This theorem was recently extended. Theorem (Christofides, Kühn, Osthus, 2011) For every α > 0 there is an integer n 0 so that every graph on n n 0 vertices of minimum degree at least ( α)n contains at least n 8 edge-disjoint Hamilton cycles. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
7 Regular Matroids A matroid M is regular if for every field F, M can be represented by some matrix over F S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
8 Regular Matroids A matroid M is regular if for every field F, M can be represented by some matrix over F Another definition: A matroid is regular if it is binary and has no F 7 - or F 7 -minor. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
9 The matroid F 7. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
10 Welsh s Conjecture A hamilton circuit in a matroid M is a circuit of size r(m) + 1. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
11 Welsh s Conjecture A hamilton circuit in a matroid M is a circuit of size r(m) Conjecture ( Welsh ) If M is a simple regular connected matroid and every cocircuit has at least (r(m) + 1) elements, then M has a hamilton circuit. 1 2 S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
12 Welsh s Conjecture A hamilton circuit in a matroid M is a circuit of size r(m) Conjecture ( Welsh ) If M is a simple regular connected matroid and every cocircuit has at least (r(m) + 1) elements, then M has a hamilton circuit. 1 2 Conjecture solved in 1997 by Hochstättler and Jackson. > 30 pages, uses Seymour s decomposition theorem. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
13 Welsh s Conjecture A hamilton circuit in a matroid M is a circuit of size r(m) Conjecture ( Welsh ) If M is a simple regular connected matroid and every cocircuit has at least (r(m) + 1) elements, then M has a hamilton circuit. 1 2 Conjecture solved in 1997 by Hochstättler and Jackson. > 30 pages, uses Seymour s decomposition theorem. Shorter proof (9 pages) by McG. in S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
14 Extending cycles in regular matroids Theorem (McG, 2010) Let M be a simple, connected, regular matroid. Suppose that C is a circuit of M where C 2d 1 for some 2 d r(m)+1 2. C d for all cocircuits C where C C =. Then there is a circuit D such that C D is a larger circuit than C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
15 Dominating circuits in matroids A circuit C in a matroid M is said to be dominating if each component of M/C has rank at most one. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
16 Dominating circuits in matroids A circuit C in a matroid M is said to be dominating if each component of M/C has rank at most one. Theorem (McG, 2011) Let M be a simple, connected, regular matroid and let C be a circuit of M where C > r(m) for all cocircuits C where C C =. Then either C is a dominating circuit or there exists a circuit D for which C D is a larger circuit than C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
17 Graphic and Cographic cases: an example C 1 * C 2 * C 1 * C 2 * C C S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
18 C-minimal circuits Given a circuit C in a matroid, a circuit D is said to be C-minimal if C D C, D, and C D are the only circuits in C D. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
19 C-minimal circuits Given a circuit C in a matroid, a circuit D is said to be C-minimal if C D C, D, and C D are the only circuits in C D. Given a circuit C in matroid, a circuit D is said to be C-augmenting if D is C-mimimal C D > C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
20 Chord-Circuits Let C be a circuit of a binary matroid M. X (C) is the set of chords of C. e be a chord of C. Let Ce 1 and Ce 2 be the circuits of C {e} which contain e. Ce 1 and Ce 2 are called chord-circuits of C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
21 Chord Circuits C 1 e and C 2 e C e 2 C e C e 1 S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
22 Nested Chords For a chord-circuit C i e we let C i i = C i e\{e}. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
23 Nested Chords For a chord-circuit C i e we let C i i = C i e\{e}. A set X of chords of a circuit C is nested if there exists an ordering x 1, x 2,..., x m of X and j 1, j 2,..., j m {1, 2} for which C j 1 x 1 C j 2 x 2 C jm x m. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
24 Nested Chords For a chord-circuit C i e we let C i i = C i e\{e}. A set X of chords of a circuit C is nested if there exists an ordering x 1, x 2,..., x m of X and j 1, j 2,..., j m {1, 2} for which C j 1 x 1 C j 2 x 2 C jm x m. C x 1 x 2 x 3 x m S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
25 C-Cocircuits For a Hamilton circuit C in a matroid M and elements e, f C, we define C ef = E(M)\cl(C\{e, f }), called a C-cocircuit. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
26 C-Cocircuits For a Hamilton circuit C in a matroid M and elements e, f C, we define C ef = E(M)\cl(C\{e, f }), called a C-cocircuit. e f S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
27 A key lemma Lemma Suppose M is a connected binary matroid having no F7 -minor and C is a circuit of M. Let D be a C-minimal circuit for which C D is minimum. Then D\C and C D are circuits of M\(C\D) which belong to different components. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
28 A picture D D\C C D C\D C S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
29 The minimal counterexample approach We use the minimal counterexample approach to prove: Theorem Let M be a simple, connected, regular matroid. Suppose that C is a circuit of M where C 2d 1 for some 2 d r(m)+1 2. C d for all cocircuits C where C C =. Then there is a circuit D such that C D is a larger circuit than C. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
30 The minimal counterexample approach We use the minimal counterexample approach to prove: Theorem Let M be a simple, connected, regular matroid. Suppose that C is a circuit of M where C 2d 1 for some 2 d r(m)+1 2. C d for all cocircuits C where C C =. Then there is a circuit D such that C D is a larger circuit than C. A minimum counterexample to the above theorem has the properties: M be a simple, connected, regular matroid. C is a circuit of size less that 2d C d for all cocircuits C where C C =. there is no circuit D such that C D is a larger circuit than C. E(M) is minimum subject to the above. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
31 Properties of a minimum counterexample There is a C-minimal circuit D for which D\C and C D are circuits of M\(C\D) which belong to different components. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
32 Properties of a minimum counterexample There is a C-minimal circuit D for which D\C and C D are circuits of M\(C\D) which belong to different components. Let N be the matroid obtained from M by deleting the component in M\(C\D) which contains C D. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
33 Properties of a minimum counterexample There is a C-minimal circuit D for which D\C and C D are circuits of M\(C\D) which belong to different components. Let N be the matroid obtained from M by deleting the component in M\(C\D) which contains C D. Important property : D can be chosen so that Ω = C D is a Hamilton circuit of N. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
34 D Ω C S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
35 Nested chords in Ω Let x be a chord of Ω such that Ω 1 x is minimal. Ω 1 x D. Important property : Assuming M has no R 10 -minor, we can choose e, f Ω 1 x such that Ω ef \{e, f } is a nested set of chords of Ω. S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
36 e f D x Ω S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
37 An extension of Welsh s conjecture 21 Conjecture ( McG ) Let M be a simple, connected, regular matroid such that every cocircuit has at least 1 2 (r(m) + 1) elements. Then M has at least αr(m) disjoint Hamilton circuits where α > 0 is a constant not depending on M S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June / 22
Regular 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 informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationDetermining a Binary Matroid from its Small Circuits
Determining a Binary Matroid from its Small Circuits James Oxley Department of Mathematics Louisiana State University Louisiana, USA oxley@math.lsu.edu Charles Semple School of Mathematics and Statistics
More informationLehrstuhl für Mathematische Grundlagen der Informatik
Lehrstuhl für Mathematische Grundlagen der Informatik W. Hochstättler, J. Nešetřil: Antisymmetric Flows in Matroids Technical Report btu-lsgdi-006.03 Contact: wh@math.tu-cottbus.de,nesetril@kam.mff.cuni.cz
More informationON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS
ON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS MANOEL LEMOS AND JAMES OXLEY Abstract. This paper proves several extremal results for 3-connected matroids. In particular, it is shown
More informationMATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT
MATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT MANOEL LEMOS AND JAMES OXLEY Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum
More informationModularity and Structure in Matroids
Modularity and Structure in Matroids by Rohan Kapadia A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics and
More informationRemoving circuits in 3-connected binary matroids
Discrete Mathematics 309 (2009) 655 665 www.elsevier.com/locate/disc Removing circuits in 3-connected binary matroids Raul Cordovil a, Bráulio Maia Junior b, Manoel Lemos c, a Departamento de Matemática,
More informationTHE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE 1. INTRODUCTION
THE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE AHMAD ABDI AND BERTRAND GUENIN ABSTRACT. It is proved that the lines of the Fano plane and the odd circuits of K 5 constitute the only minimally
More informationCycle Double Covers and Semi-Kotzig Frame
Cycle Double Covers and Semi-Kotzig Frame Dong Ye and Cun-Quan Zhang arxiv:1105.5190v1 [math.co] 26 May 2011 Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310 Emails: dye@math.wvu.edu;
More informationOn the interplay between graphs and matroids
On the interplay between graphs and matroids James Oxley Abstract If a theorem about graphs can be expressed in terms of edges and circuits only it probably exemplifies a more general theorem about matroids.
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: On the Chromatic Number of an Oriented Matroid Technical Report feu-dmo007.07 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationSpanning cycles in regular matroids without M (K 5 ) minors
Spanning cycles in regular matroids without M (K 5 ) minors Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao Abstract Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII CAROLYN CHUN AND JAMES OXLEY Abstract. Let M be a 3-connected binary matroid; M is internally 4- connected if one side of every
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 informationContractible bonds in graphs
Journal of Combinatorial Theory, Series B 93 (2005) 207 249 www.elsevier.com/locate/jctb Contractible bonds in graphs Sean McGuinness 7 London Road, Syosset, NY 79, USA Received 2 August 200 Available
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Luis A. Goddyn Winfried Hochstättler: Nowhere-zero flows in regular matroids and Hadwiger s Conjecture Technical Report feu-dmo031.13 Contact: goddyn@sfu.ca winfried.hochstaettler@fernuni-hagen.de
More informationPage Line Change 80-5 Replace by Adjoin or delete a zero row Omit non-zero before column Replace the sentence beginning Clearly
MATROID THEORY James G. Oxley Oxford University Press, New York, 1992 Errata and Update on Conjectures, Problems, and References Latest update: December 10, 2005 The comments below apply to all printings
More informationA Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids
Journal of Algebraic Combinatorics 12 (2000), 295 300 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids WINFRIED HOCHSTÄTTLER
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary
More informationRelaxations of GF(4)-representable matroids
Relaxations of GF(4)-representable matroids Ben Clark James Oxley Stefan H.M. van Zwam Department of Mathematics Louisiana State University Baton Rouge LA United States clarkbenj@myvuw.ac.nz oxley@math.lsu.edu
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. This paper proves a preliminary step towards a splitter theorem for internally
More informationMatroid Secretary for Regular and Decomposable Matroids
Matroid Secretary for Regular and Decomposable Matroids Michael Dinitz Weizmann Institute of Science mdinitz@cs.cmu.edu Guy Kortsarz Rutgers University, Camden guyk@camden.rutgers.edu Abstract In the matroid
More informationWHAT IS A MATROID? JAMES OXLEY
WHAT IS A MATROID? JAMES OXLEY Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Whitney s definition embraces a surprising diversity of combinatorial
More informationCHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS
CHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS Gordon Royle School of Mathematics & Statistics University of Western Australia Bert s Matroid Jamboree Maastricht 2012 AUSTRALIA PERTH WHERE EVERY PROSPECT
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. Let M and N be internally 4-connected binary matroids such that M has a proper
More informationON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID
ON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID RHIANNON HALL Abstract. Let K 3,n, n 3, be the simple graph obtained from K 3,n by adding three edges to a vertex part of size three. We prove
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 informationMatroid Secretary for Regular and Decomposable Matroids
Matroid Secretary for Regular and Decomposable Matroids Michael Dinitz Johns Hopkins University mdinitz@cs.jhu.edu Guy Kortsarz Rutgers University, Camden guyk@camden.rutgers.edu Abstract In the matroid
More informationFinite connectivity in infinite matroids
Finite connectivity in infinite matroids Henning Bruhn Paul Wollan Abstract We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid,
More informationA Decomposition Theorem for Binary Matroids with no Prism Minor
DOI 10.1007/s00373-013-1352-6 ORIGINAL PAPER A Decomposition Theorem for Binary Matroids with no Prism Minor S. R. Kingan Manoel Lemos Received: 21 March 2012 / Revised: 13 January 2013 Springer Japan
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationarxiv: v1 [math.co] 19 Oct 2018
On the structure of spikes arxiv:1810.08416v1 [math.co] 19 Oct 2018 Abstract Vahid Ghorbani, Ghodratollah Azadi and Habib Azanchiler Department of mathematics, University of Urmia, Iran Spikes are an important
More informationInfinite circuits in infinite graphs
Infinite circuits in infinite graphs Henning Bruhn Universität Hamburg R. Diestel, A. Georgakopoulos, D. Kühn, P. Sprüssel, M. Stein Henning Bruhn (U Hamburg) Infinite circuits Haifa 08 1 / 25 Locally
More informationCounting Matroids. Rudi Pendavingh. 6 July, Rudi Pendavingh Counting Matroids 6 July, / 23
Counting Matroids Rudi Pendavingh 6 July, 2015 Rudi Pendavingh Counting Matroids 6 July, 2015 1 / 23 First steps Definitions [n] := {1,..., n} m n := #{M matroid : E(M) = [n]} m n,r := #{M matroid : E(M)
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler: Towards a flow theory for the dichromatic number Technical Report feu-dmo032.14 Contact: winfried.hochstaettler@fernuni-hagen.de FernUniversität
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 informationRelation between pairs of representations of signed. binary matroids
Relation between pairs of representations of signed binary matroids Bertrand Guenin, Irene Pivotto, Paul Wollan August 16, 2011 Abstract We show how pairs of signed graphs with the same even cycles relate
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationCycle decompositions of the complete graph
Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationSome Results on Paths and Cycles in Claw-Free Graphs
Some Results on Paths and Cycles in Claw-Free Graphs BING WEI Department of Mathematics University of Mississippi 1 1. Basic Concepts A graph G is called claw-free if it has no induced subgraph isomorphic
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 informationarxiv: v2 [math.co] 23 Oct 2015
Decomposition of Quaternary Signed-Graphic Matroids arxiv:1510.06727v2 [math.co] 23 Oct 25 Abstract Leonidas Pitsoulis, Eleni-Maria Vretta Department of Electrical and Computer Engineering Aristotle University
More informationOn zeros of the characteristic polynomial of matroids of bounded tree-width
On zeros of the characteristic polynomial of matroids of bounded tree-width By Carolyn Chun, Rhiannon Hall, Criel Merino, Steven Noble Birkbeck Pure Mathematics Preprint Series Preprint Number 26 www.bbk.ac.uk/ems/research/pure/preprints
More informationCost-Constrained Matchings and Disjoint Paths
Cost-Constrained Matchings and Disjoint Paths Kenneth A. Berman 1 Department of ECE & Computer Science University of Cincinnati, Cincinnati, OH Abstract Let G = (V, E) be a graph, where the edges are weighted
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 information1 Some loose ends from last time
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Kruskal s and Borůvka s MST algorithms September 20, 2010 1 Some loose ends from last time 1.1 A lemma concerning greedy algorithms and
More informationTHE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS
THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS DANIELA KÜHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular
More informationMatroid intersection, base packing and base covering for infinite matroids
Matroid intersection, base packing and base covering for infinite matroids Nathan Bowler Johannes Carmesin June 25, 2014 Abstract As part of the recent developments in infinite matroid theory, there have
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 informationA NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS
A NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS JOÃO GOUVEIA, MONIQUE LAURENT, PABLO A. PARRILO, AND REKHA THOMAS Abstract. The theta bodies of a polynomial ideal
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 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 informationBalanced Signings and the Chromatic Number of Oriented Matroids
Balanced Signings and the Chromatic Number of Oriented Matroids Luis Goddyn * Department of Mathematics Simon Fraser University Burnaby, BC, Canada E-mail: goddyn@math.sfu.ca and Petr Hliněný Department
More informationMatroid Secretary for Regular and Decomposable Matroids
Matroid Secretary for Regular and Decomposable Matroids Michael Dinitz Weizmann Institute of Science mdinitz@cs.cmu.edu Guy Kortsarz Rutgers University, Camden guyk@camden.rutgers.edu Abstract In the matroid
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 informationProof of the 1-factorization and Hamilton Decomposition Conjectures. Béla Csaba Daniela Kühn Allan Lo Deryk Osthus Andrew Treglown
Proof of the 1-factorization and Hamilton Decomposition Conjectures Béla Csaba Daniela Kühn Allan Lo Deryk Osthus Andrew Treglown Author address: Bolyai Institute, University of Szeged, H-6720 Szeged,
More informationMATROIDS DENSER THAN A PROJECTIVE GEOMETRY
MATROIDS DENSER THAN A PROJECTIVE GEOMETRY PETER NELSON Abstract. The growth-rate function for a minor-closed class M of matroids is the function h where, for each non-negative integer r, h(r) is the maximum
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 informationA PARTIAL CHARACTERIZATION OF THE COCIRCUITS OF A SPLITTING MATROID
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT A PARTIAL CHARACTERIZATION OF THE COCIRCUITS OF A SPLITTING MATROID DR. ALLAN D. MILLS MAY 2004 No. 2004-2 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505
More informationHAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: APPLICATIONS
HAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: APPLICATIONS DANIELA KÜHN AND DERYK OSTHUS Abstract. In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree
More informationGraph Minors Theory. Bahman Ghandchi. Institute for Advanced Studies in Basic Sciences (IASBS) SBU weekly Combinatorics Seminars November 5, 2011
Graph Minors Theory Bahman Ghandchi Institute for Advanced Studies in Basic Sciences (IASBS) SBU weekly Combinatorics Seminars November 5, 2011 Institute for Advanced Studies in asic Sciences Gava Zang,
More informationarxiv: v1 [math.co] 20 Sep 2012
arxiv:1209.4628v1 [math.co] 20 Sep 2012 A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst Department
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More informationMinimum degree conditions for large subgraphs
Minimum degree conditions for large subgraphs Peter Allen 1 DIMAP University of Warwick Coventry, United Kingdom Julia Böttcher and Jan Hladký 2,3 Zentrum Mathematik Technische Universität München Garching
More informationFinding many edge-disjoint Hamiltonian cycles in dense graphs
Finding many edge-disjoint Hamiltonian cycles in dense graphs Stephen G. Hartke Department of Mathematics University of Nebraska Lincoln www.math.unl.edu/ shartke2 hartke@math.unl.edu Joint work with Tyler
More informationThe Greedy Algorithm for the Symmetric TSP
The Greedy Algorithm for the Symmetric TSP Gregory Gutin Anders Yeo Abstract We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper.
More informationRota s Conjecture. Jim Geelen, Bert Gerards, and Geoff Whittle
Rota s Conjecture Jim Geelen, Bert Gerards, and Geoff Whittle Rota s Conjecture For each finite field field F, there are at most a finite number of excluded minors for F-representability. Ingredients of
More informationA SHARP BOUND ON THE SIZE OF A CONNECTED MATROID
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 353, Number 10, Pages 4039 4056 S 000-9947(01)0767- Article electronically published on June 1, 001 A SHARP BOUND ON THE SIZE OF A CONNECTED MATROID
More informationMINORS OF GRAPHS OF LARGE PATH-WIDTH. A Dissertation Presented to The Academic Faculty. Thanh N. Dang
MINORS OF GRAPHS OF LARGE PATH-WIDTH A Dissertation Presented to The Academic Faculty By Thanh N. Dang In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Algorithms, Combinatorics
More informationEXCLUDING SUBDIVISIONS OF INFINITE CLIQUES. Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
EXCLUDING SUBDIVISIONS OF INFINITE CLIQUES Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown, New
More informationOn Matroid and Polymatroid Connectivity
Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2014 On Matroid and Polymatroid Connectivity Dennis Wayne Hall II Louisiana State University and Agricultural and
More informationBlocks and 2-blocks of graph-like spaces
Blocks and 2-blocks of graph-like spaces von Hendrik Heine Masterarbeit vorgelegt der Fakultät für Mathematik, Informatik und Naturwissenschaften der Universität Hamburg im Dezember 2017 Gutachter: Prof.
More informationCompatible Circuit Decompositions of Eulerian Graphs
Compatible Circuit Decompositions of Eulerian Graphs Herbert Fleischner, François Genest and Bill Jackson Septemeber 5, 2006 1 Introduction Let G = (V, E) be an Eulerian graph. Given a bipartition (X,
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel: On a base exchange game on bispanning graphs Technical Report feu-dmo09.11 Contact: dominique.andres@fernuni-hagen.de,
More informationBranchwidth of graphic matroids.
Branchwidth of graphic matroids. Frédéric Mazoit and Stéphan Thomassé Abstract Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is
More informationBicircular Matroids are 3-colorable
Bicircular Matroids are 3-colorable Luis Goddyn Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby BC V5A 1S6, Canada Winfried Hochstättler FernUniversität in Hagen, Fakultät
More informationAdding random edges to create the square of a Hamilton cycle
Adding random edges to create the square of a Hamilton cycle Patrick Bennett Andrzej Dudek Alan Frieze October 7, 2017 Abstract We consider how many random edges need to be added to a graph of order n
More informationUNAVOIDABLE CONNECTED MATROIDS RETAINING A SPECIFIED MINOR
UNAVOIDABLE CONNECTED MATROIDS RETAINING A SPECIFIED MINOR CAROLYN CHUN, GUOLI DING, DILLON MAYHEW, AND JAMES OXLEY Abstract. A sufficiently large connected matroid M contains a big circuit or a big cocircuit.
More informationAN INTRODUCTION TO TRANSVERSAL MATROIDS
AN INTRODUCTION TO TRANSVERSAL MATROIDS JOSEPH E BONIN October 26, 2010 CONTENTS 1 Prefatory Remarks 1 2 Several Perspectives on Transversal Matroids 2 21 Set systems, transversals, partial transversals,
More informationChordal Coxeter Groups
arxiv:math/0607301v1 [math.gr] 12 Jul 2006 Chordal Coxeter Groups John Ratcliffe and Steven Tschantz Mathematics Department, Vanderbilt University, Nashville TN 37240, USA Abstract: A solution of the isomorphism
More informationCompatible Circuit Decompositions of 4-Regular Graphs
Compatible Circuit Decompositions of 4-Regular Graphs Herbert Fleischner, François Genest and Bill Jackson Abstract A transition system T of an Eulerian graph G is a family of partitions of the edges incident
More informationExcluded t-factors in Bipartite Graphs:
Excluded t-factors in Bipartite Graphs: A nified Framework for Nonbipartite Matchings and Restricted -matchings Blossom and Subtour Elimination Constraints Kenjiro Takazawa Hosei niversity, Japan IPCO017
More informationVertices of Small Degree in Uniquely Hamiltonian Graphs
Journal of Combinatorial Theory, Series B 74, 265275 (1998) Article No. TB981845 Vertices of Small Degree in Uniquely Hamiltonian Graphs J. A. Bondy Institut de Mathe matiques et Informatique, Universite
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler: A flow theory for the dichromatic number (extended version of feu-dmo 032.14) Technical Report feu-dmo041.15 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationFinding Hamilton cycles in robustly expanding digraphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 16, no. 2, pp. 335 358 (2012) Finding Hamilton cycles in robustly expanding digraphs Demetres Christofides 1 Peter Keevash 1 Daniela
More informationHamilton weight and Petersen minor
Hamilton weight and Petersen minor Hong-Jian Lai and Cun-Quan Zhang Department of Mathematics West Virginia University Morgantown, WV 26506-6310, USA Email: hjlai@math.wvu.edu, cqzhang@math.wvu.edu Abstract
More informationGallai s Conjecture For Graphs of Girth at Least Four. Peter Harding and Sean McGuinness Thompson Rivers University
Gallai s Conjecture For Graphs of Girth at Least Four Peter Harding and Sean McGuinness Thompson Rivers University i Gallai s Conjecture For Graphs of Girth at Least Four Peter Harding and Sean McGuinness
More informationBINARY SUPERSOLVABLE MATROIDS AND MODULAR CONSTRUCTIONS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 113, Number 3, November 1991 BINARY SUPERSOLVABLE MATROIDS AND MODULAR CONSTRUCTIONS GÜNTER M. ZIEGLER (Communicated by Thomas H. Brylawski) Abstract.
More informationOn the Numbers of Bases and Circuits in Simple Binary Matroids
Europ. J. Combinatorics (1983) 4, 169-178 On the Numbers of Bases and Circuits in Simple Binary Matroids JAMES G. OXLEY Quirk and Seymour have shown that a connected simple graph has at least as many spanning
More informationEven cycle decompositions of 4-regular graphs and line graphs
Even cycle decompositions of 4-regular graphs and line graphs Klas Markström Abstract. Anevencycledecompositionofagraphisapartitionofitsedgeintoeven cycles. We first give some results on the existence
More informationLong cycles have the edge-erdős-pósa property
Long cycles have the edge-erdős-pósa property Henning Bruhn, Matthias Heinlein and Felix Joos Abstract We prove that the set of long cycles has the edge-erdős-pósa property: for every fixed integer l 3
More informationPERFECT BINARY MATROIDS
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT PERFECT BINARY MATROIDS Allan Mills August 1999 No. 1999-8 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505 PERFECT BINARY MATROIDS ALLAN D. MILLS Abstract.
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 informationRayleigh Property of Lattice Path Matroids
Rayleigh Property of Lattice Path Matroids by Yan Xu A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathemeatics in Combinatorics and
More informationTHE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE
THE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE RHIANNON HALL, JAMES OXLEY, AND CHARLES SEMPLE Abstract. A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a
More informationAdvanced Combinatorial Optimization September 24, Lecture 5
18.438 Advanced Combinatorial Optimization September 24, 2009 Lecturer: Michel X. Goemans Lecture 5 Scribe: Yehua Wei In this lecture, we establish the connection between nowhere-zero (nwz) k-flow and
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 BINARY MATROIDS WITH NO 4-WHEEL MINOR
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 301. Number I. May 1987 THE BINARY MATROIDS WITH NO 4-WHEEL MINOR JAMES G. OXLEY ABSTRACT. The cycle matroids of wheels are the fundamental building
More information