DOCSLIB.ORG

Structural and Decomposition Results for Binet Matrices, Bidirected Graphs and Signed-Graphic Matroids

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Structural and Decomposition Results for Binet Matrices, Bidirected Graphs and Signed-Graphic Matroids London School of Economics and Political Science Structural and decomposition results for binet matrices, bidirected graphs and signed-graphic matroids Konstantinos Papalamprou Thesis submitted for the degree of Doctor of Philosophy in Operational Research London, 2009 UMI Number: U613425 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. Dissertation Publishing UMI U613425 Published by ProQuest LLC 2014. Copyright in the Dissertation held by the Author. Microform Edition © ProQuest LLC. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code. ProQuest LLC 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, Ml 48106-1346 TW ^es p W ° \ r n Librar\ ' >US^y of Political ancfEeftWVnic Soenrp IZ3IS4 ' Declaration I certify that the thesis I have presented for examination for the MPhil/PhD degree of the London School of Economics and Political Science is solely my own work other than where I have clearly indicated that it is the work of others (in which case the extent of any work carried out jointly by me and any other person is clearly identified in it). The copyright of this thesis rests with the author. Quotation from it is permitted, provided that full acknowledgement is made. This thesis may not be reproduced without the prior written consent of the author. I warrant that this authorization does not, to the best of my belief, infringe the rights of any third party. 3 Abstract In this thesis we deal with binet matrices and the class of signed-graphic matroids which is the class of matroids represented over R by binet matrices. The thesis is divided in three parts. In the first part, we provide the vast majority of the notions used throughout the thesis and some results regarding the class of binet matrices. In this part, we focus on the class of linear and integer programming problems in which the constraint matrix is binet and provide methods and algorithms which solve these problems efficiently. Results of the part regarding the optimization with binet matrices are joint work with G. Appa, B. Kotnyek and L. Pitsoulis and have been published in [5]. The main new result is that the existing combinatorial methods can not solve the { 0 , \ }-separation problem (special case of the well known separation problem) with integral binet matrices. The main new results of the whole thesis are provided in the next two parts. In the second part, we present a polynomial time algorithm to construct a bidirected graph for any totally unimodular matrix B by finding node-edge incidence matrices Q and S such that QB = S. Seymour’s famous decomposition theorem for regular matroids states that any totally unimodular matrix can be constructed through a series of composition operations called fc-sums starting from network matrices and their transposes and two compact representation matrices B\ and B 2 of a certain ten element matroid. Given that B\ and B 2 are binet matrices, we examine the /c-sums of network and binet matrices (k = 1,2,3). It is shown that the k- sum of a network and a binet matrix is a binet matrix, but binet matrices are not closed under this operation for k = 2,3. A new class of matrices is introduced, the so-called tour matrices, which generalises network and totally unimodular matrices. For any such matrix there exists a bidirected graph such that the columns represent a collection of closed tours in the graph. It is shown that tour matrices are closed under 1-, 2- and ©3-sum as well as under elementary operations on their rows and columns. Given the constructive proofs of the above results regarding the fc-sum operations and existing recognition algorithms for network and binet matrices, an algorithm is presented which constructs a bidirected graph for any totally unimodular matrix. I should note here that many results of this part are joint work with G. Appa, B. Kotnyek and L. Pitsoulis; these results can be found in a joint journal article [61]. In the third part of this thesis we deal with the frame matroid of a signed graph, or simply the signed- graphic matroid. Several new results are provided in this last part of the thesis. Specifically, given a signed graph, we provide methods to find representation matrices of the associated signed-graphic matroid over GF(2), GF(3) and R. Furthermore, two new matroid recognition algorithms are presented in this last part. The first one determines whether a binary matroid is signed-graphic or not and the second one determines whether a (general) matroid is binary signed-graphic or not. Finally, one of the most important new results of this thesis is the decomposition theory for the class of binary signed-graphic 4 Abstract 5 matroids which is provided in the last chapter. In order to achieve this result, we employed Tutte’s theory of bridges. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on k-sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minors resulting from the deletion of a cocircuit of a binary matroid will be graphic matroids except for one that will be signed-graphic if and only if the matroid is signed-graphic. The decomposition theory for binary signed-graphic matroids is a joint work with G. Appa and L. Pitsoulis. Dedicated to my parents: Athanassios Papalamprou and Eleni Mparpagianni to my brother: Marios Papalamprou and to Vasiliki Samartzi Acknowledgements First and foremost, I would like to thank my supervisor Professor Gautam Appa for giving me the op­ portunity and motivation to write this thesis. His guidance and assistance were invaluable in completing this work. I would also like to thank Dr Leonidas Pitsoulis who assisted me during these years and whose personal attention, support and long hours of discussion were essential for my work. The mathematical insight, generosity and tremendous encouragement of these two people were overwhelming during the preparation of this thesis. I would also like to thank the two examiners of this thesis, Professor Graham Brightwell and Dr Kristina Vuskovic, for their valuable comments/suggestions and for bringing to my attention recent results regard­ ing the Well-Quasi-Ordering conjecture and the Minor-Recognition conjecture for matroids. The Operational Research Group at the LSE is an exciting and inspiring environment for someone to do research and, for that reason, I would like to thank all the members of the Operational Research Group. My special thanks go to my fellow PhD students for their friendship and help during these years. I was lucky enough to have very good friends during my years as a PhD student; in particular I would like to thank Mr Petros Machlis, Mr Vassilis Papatheodorou and Mr Michael Xanthakis for their support and understanding. I should also like to acknowledge the financial support of the Bodossaki Foundation, the Greek State Scholarships’ Foundation, and the London School of Economics and Political Science. I am forever indebted to my family, whose love, support, and patience are invaluable for me. There­ fore, thanks go to my father Athanassios, my mother Eleni and my brother Marios. Finally, I would like to thank Miss Vasiliki Samartzi for her love and support all these years. I feel that I can find her love and support behind every single word of this thesis. Konstantinos Papalamprou London, 2009 7 Contents I Introduction 13 1 Basic definitions and notation 14 1.1 Sets and fields ..................................................................................................................... 14 1.2 Matrices and polyhedra ..................................................................................................... 16 1.3 Graphs................................................................................................................................ 18 1.4 Digraphs and network matrices .......................................................................................... 24 1.5 Totally unimodular matrices ............................................................................................ 25 1.6 Relevant matroid theory ..................................................................................................... 28 1.6 .1 Definitions and important classes of matroids ....................................................... 28 1.6.2 Duality and m inors ................................................................................................. 30 1.6.3 Connectivity .......................................................................................................... 32 2 Bidirected graphs and binet matrices 34 2.1 Bidirected graphs ............................................................................................................... 34 2.1.1 Basic notions .......................................................................................................... 35 2.1.2 Some operations and the circuits of bidirected graphs ............................................ 37 2.2 Binet matrices and related classes of m atrices .................................................................. 39 2.2.1 Binet matrices ......................................................................................................
Load more

Recommended publications
  • Biased Graphs. Vii. Contrabalance and Antivoltages
    BIASED GRAPHS. VII. CONTRABALANCE AND ANTIVOLTAGES THOMAS ZASLAVSKY Abstract. We develop linear representation theory for bicircular matroids, a chief exam- ple being a matroid associated with forests of a graph, and bicircular lift matroids, a chief example being a matroid associated with spanning forests. (These are bias and lift matroids of contrabalanced biased graphs.) The theory is expressed largely in terms of antivoltages (edge labellings that defy Kirchhoff’s voltage law) with values in the multiplicative or ad- ditive group of the scalar field. We emphasize antivoltages with values in cyclic groups and finite vector spaces since they are crucial for representing the matroids over finite fields; and integer-valued antivoltages with bounded breadth since they are crucial in constructions. We find bounds for the existence of antivoltages and we solve some examples. Other results: The number of antivoltages in an abelian group is a polynomial function of the group order, and the number of integral antivoltages with bounded breadth is a polynomial in the breadth bound. We conclude with an application to complex representation. There are many open questions. Contents Introduction 2 1. Background 3 2. General bounds on representability and antivoltages 5 3. Modular, integral, and prime-power antivoltages 7 4. Minors and matroids 11 5. Completegraphsandcomplete-graphbounds 11 6. More examples 16 7. The number of antivoltages 18 8. Root-of-unity representations 21 References 21 Date: March 2001; Aug., 2002; Aug.–Sept., 2004; Nov.–Dec., 2005. Version of April 3, 2007. 2000 Mathematics Subject Classification. Primary 05B35, 05C22; Secondary 05A15, 05C35. Key words and phrases. Antivoltage, bicircular matroid, bicircular lift matroid, forest matroid, spanning forest matroid, biased graph, gain graph, contrabalance, bias matroid, frame matroid, matroid representation, transversal matroid.
    [Show full text]
  • Some Topics Concerning Graphs, Signed Graphs and Matroids
    SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results.
    [Show full text]
  • The Steiner Problem for Count Matroids
    Egervary´ Research Group on Combinatorial Optimization Technical reportS TR-2020-03. Published by the Egerv´aryResearch Group, P´azm´any P. s´et´any 1/C, H{1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres . ISSN 1587{4451. The Steiner problem for count matroids Tibor Jord´an,Yusuke Kobayashi, Ryoga Mahara, and Kazuhisa Makino December 2020 EGRES Technical Report No. 2020-03 1 The Steiner problem for count matroids? Tibor Jord´an??, Yusuke Kobayashi, Ryoga Mahara, and Kazuhisa Makino ??? Abstract We introduce and study a generalization of the well-known Steiner tree prob- lem to count matroids. In the count matroid Mk;l(G), defined on the edge set of a graph G = (V; E), a set F ⊆ E is independent if every vertex set X ⊆ V spans at most kjXj − l edges of F . The graph is called (k; l)-tight if its edge set is independent in Mk;l(G) and jEj = kjV j − l holds. Given a graph G = (V; E), a non-negative length function w : E ! R, a set T ⊆ V of terminals and parameters k; l, our goal is to find a shortest (k; l)- tight subgraph of G that contains the terminals. Since M1;1(G) is isomorphic to the graphic matroid of G, the special case k = l = 1 corresponds to the Steiner tree problem. We obtain other interesting problems by choosing different parameters: for example, in the case k = 2, l = 3 the target is a shortest rigid subgraph containing all terminals. First we show that this problem is NP-hard even if k = 2, l = 3, and w is metric, or w ≡ 1 and jT j = 2.
    [Show full text]
  • Sparsity Counts in Group-Labeled Graphs and Rigidity
    Sparsity Counts in Group-labeled Graphs and Rigidity Rintaro Ikeshita1 Shin-ichi Tanigawa2 1University of Tokyo 2CWI & Kyoto University July 15, 2015 1 / 23 I Examples I k = ` = 1: forest I k = 1; ` = 0: pseudoforest I k = `: Decomposability into edge-disjoint k forests (Nash-Williams) I ` ≤ k: Decomposability into edge-disjoint k − ` pseudoforests and ` forests I general k; `: Rigidity of graphs and scene analysis (k; `)-sparsity def I A finite undirected graph G = (V ; E) is (k; `)-sparse , jF j ≤ kjV (F )j − ` for every F ⊆ E with kjV (F )j − ` ≥ 1. 2 / 23 (k; `)-sparsity def I A finite undirected graph G = (V ; E) is (k; `)-sparse , jF j ≤ kjV (F )j − ` for every F ⊆ E with kjV (F )j − ` ≥ 1. I Examples I k = ` = 1: forest I k = 1; ` = 0: pseudoforest I k = `: Decomposability into edge-disjoint k forests (Nash-Williams) I ` ≤ k: Decomposability into edge-disjoint k − ` pseudoforests and ` forests I general k; `: Rigidity of graphs and scene analysis 2 / 23 I Examples I k = ` = 1: graphic matroid I k = 1; ` = 0: bicircular matroid I ` ≤ k: union of k − ` copies of bicircular matroid and ` copies of graphic matroid I k = 2; ` = 3: generic 2-rigidity matroid (Laman70) Count Matroids I Suppose ` ≤ 2k − 1. Then Mk;`(G) = (E; Ik;`) forms a matroid, called the (k; `)-count matroid, where Ik;` = fI ⊆ E : I is (k; `)-sparseg: 3 / 23 Count Matroids I Suppose ` ≤ 2k − 1. Then Mk;`(G) = (E; Ik;`) forms a matroid, called the (k; `)-count matroid, where Ik;` = fI ⊆ E : I is (k; `)-sparseg: I Examples I k = ` = 1: graphic matroid I k = 1; ` = 0: bicircular matroid I ` ≤ k: union of k − ` copies of bicircular matroid and ` copies of graphic matroid I k = 2; ` = 3: generic 2-rigidity matroid (Laman70) 3 / 23 Group-labeled Graphs I A group-labeled graph (Γ-labeled graph) (G; ) is a directed finite graph whose edges are labeled invertibly from a group Γ.
    [Show full text]
  • DEFINING BICIRCULAR MATROIDS in MONADIC LOGIC 1. Introduction
    DEFINING BICIRCULAR MATROIDS IN MONADIC LOGIC DARYL FUNK, DILLON MAYHEW, AND MIKE NEWMAN Abstract. We conjecture that the class of frame matroids can be char- acterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bi- circular matroids. The proof does not depend on an excluded-minor characterisation. 1. Introduction The ability of monadic second-order logic to express graph properties has been investigated for some time [5, 10, 22]. This study continues to be motivated by Courcelle's famous theorem showing that such a property can be tested in polynomial time for any class of input graphs with bounded tree-width [4]. On the other hand, the literature on matroid properties that can be expressed in monadic second-order logic is more recent, and sparser [16,19]. Our aim here is to add to this literature, by making progress towards the following conjecture. Conjecture 1.1. There is a sentence in the monadic second-order language of matroids which characterises the class of frame matroids. The monadic second-order logic for matroids (MS 0) is formally defined in Section 3. We also conjecture that there are MS 0-characterisations of Zaslavsky's class of lift matroids [23] and the class of quasi-graphic matroids [1,15]. Let G be a graph. If X is a set of edges in G, then V (X) is the set of vertices incident with at least one edge in X, and G[X] is the subgraph with X as its edge-set and V (X) as its vertex-set.
    [Show full text]
  • Bicircular 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¨attler FernUniversit¨atin Hagen, Fakult¨atf¨urMathematik und Informatik, 58084 Hagen Nancy Ann Neudauer Nancy Ann Neudauer, Department of Mathematics and Computer Science, Pacific University, Forest Grove, OR 97116, USA Abstract Hugo Hadwiger proved that a graph that is not 3-colorable must have a K4- minor and conjectured that a graph that is not k-colorable must have a Kk+1- minor. By using the Hochst¨attler-Neˇsetˇrildefinition for the chromatic number of an oriented matroid, we formulate a generalized version of Hadwiger's conjecture that might hold for the class of oriented matroids. In particular, it is possible that every oriented matroid with no M(K4)-minor is 3-colorable. The fact that K4-minor-free graphs are characterized as series-parallel net- works leads to an easy proof that they are all 3-colorable. We show how to extend this argument to a particular subclass of M(K4)-minor-free oriented matroids. Specifically we generalize the notion of being series-parallel to ori- ented matroids, and then show that generalized series-parallel oriented matroids are 3-colorable. To illustrate the method, we show that every orientation of a bicircular matroid is 3-colorable. Keywords: colorings, series-parallel networks, matroids, oriented matroids 2000 MSC: 05C15, 05B35, 52C40 1. Introduction Hadwiger's conjecture [13], that every graph that is not k-colorable must have a Kk+1-minor for k ≥ 1, is \one of the deepest unsolved problems in graph theory"[5].
    [Show full text]
  • Bicircular Matroids with Circuits of at Most Two Sizes
    University of Mississippi eGrove Electronic Theses and Dissertations Graduate School 1-1-2010 Bicircular Matroids with Circuits of at Most Two Sizes Torina Deachune Lewis University of Mississippi Follow this and additional works at: https://egrove.olemiss.edu/etd Part of the Mathematics Commons Recommended Citation Lewis, Torina Deachune, "Bicircular Matroids with Circuits of at Most Two Sizes" (2010). Electronic Theses and Dissertations. 1437. https://egrove.olemiss.edu/etd/1437 This Dissertation is brought to you for free and open access by the Graduate School at eGrove. It has been accepted for inclusion in Electronic Theses and Dissertations by an authorized administrator of eGrove. For more information, please contact [email protected]. To The Graduate Council: I am submitting herewith a dissertation written by Torina Deachune Lewis entitled Bicircular Matroids with Circuits of at Most Two Sizes I have examined the final copy of this thesis for form and content and recommend that it be accepted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics. Dr. Talmage James Reid Professor of Mathematics We have read this dissertation and recommend its acceptance: Dr. Iwo Labuda, Chair and Professor of Mathematics Dr. Laura Sheppardson, Associate Professor of Mathematics Dr. Dawn Wilkins, Associate Professor of Computer and Information Science Dr. Haidong Wu, Associate Professor of Mathematics Bicircular Matroids with Circuits of at Most Two Sizes A Dissertation Presented for the Doctor of Philosophy Degree Department of Mathematics University of Mississippi Torina Deachune Lewis Advisers: Drs. Talmage James Reid and Laura Sheppardson December 3, 2010 Acknowledgments The writing of a dissertation can be a lonely and isolating experience, yet it is obviously not possible without the personal and practical support of numerous people.
    [Show full text]
  • Obstructions for Bounded Branch-Depth in Matroids
    ADVANCES IN COMBINATORICS, 2021:4, 25 pp. www.advancesincombinatorics.com Obstructions for Bounded Branch-depth in Matroids J. Pascal Gollin* Kevin Hendrey* Dillon Mayhew† Sang-il Oum* Received 1 April 2020; Revised 22 January 2021; Published 24 May 2021 Abstract: DeVos, Kwon, and Oum introduced the concept of branch-depth of matroids as a natural analogue of tree-depth of graphs. They conjectured that a matroid of sufficiently large branch-depth contains the uniform matroid Un;2n or the cycle matroid of a large fan graph as a minor. We prove that matroids with sufficiently large branch-depth either contain the cycle matroid of a large fan graph as a minor or have large branch-width. As a corollary, we prove their conjecture for matroids representable over a fixed finite field and quasi-graphic matroids, where the uniform matroid is not an option. Key words and phrases: matroids, branch-depth, branch-width, twisted matroids, representable ma- troids, quasi-graphic matroids 1 Introduction Motivated by the notion of tree-depth of graphs, DeVos, Kwon, and Oum [3] introduced the branch- 1 depth of a matroid M as follows. Recall that the connectivity function lM of a matroid M is defined as lM(X) = r(X) + r(E(M) n X) − r(E(M)), where r is the rank function of M.A decomposition is a arXiv:2003.13975v2 [math.CO] 20 May 2021 pair (T;s) consisting of a tree T with at least one internal node and a bijection s from E(M) to the set of leaves of T.
    [Show full text]
  • On 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 ma- troids.” This assertion, made by Tutte more than twenty years ago, will be the theme of this paper. In particular, a number of examples will be given of the two-way interaction between graph theory and matroid theory that enriches both subjects. 1 Introduction This paper aims to be accessible to those with no previous experience of matroids; only some basic familiarity with graph theory and linear algebra will be assumed. In particular, the next section introduces matroids by showing how such objects arise from graphs. It then presents a minimal amount of the- ory to make the rest of the paper comprehensible. Throughout, the emphasis is on the links between graphs and matroids. Section 3 begins by showing how 2-connectedness for graphs extends natu- rally to matroids. It then indicates how the number of edges in a 2-connected loopless graph can be bounded in terms of the circumference and the size of a largest bond. The main result of the section extends this graph result to ma- troids. The results in this section provide an excellent example of the two-way interaction between graph theory and matroid theory. In order to increase the accessibility of this paper, the matroid technicalities have been kept to a minimum. Most of those that do arise have been separated from the rest of the paper and appear in two separate sections, 4 and 10, which deal primarily with proofs.
    [Show full text]
  • Extremal Matroid Theory and the Erdös-Pósa Theorem
    Extremal Matroid Theory and The ErdÄos-P¶osaTheorem Kasper Kabell Department of Mathematical Sciences University of Aarhus, Denmark PhD Thesis January 2006 This thesis is submitted to the Faculty of Science at the University of Aarhus, Denmark, in order to ful¯l the requirements for obtaining the PhD degree in Mathematics. The studies have been carried out under the supervision of J¿rgen Brandt at the Department of Mathematical Sciences, University of Aarhus from March 2002 to January 2006. Contents Preface iii 1 Introduction 1 1 Outline and main results . 2 2 Prerequisites and notation . 2 2 The ErdÄos-P¶osaTheorem for matroids 5 1 The ErdÄos-P¶osaproperty . 5 2 Considerations on the main theorem . 7 3 Covering number . 8 4 Round matroids . 11 5 Building density . 14 6 Arranging circuits . 17 7 Nests . 23 8 Dowling-cliques . 29 9 Cliques . 33 10 Mader's Theorem for matroids . 36 3 Projective geometries in dense matroids 41 1 The main results . 41 2 Long lines . 42 3 Pyramids . 45 4 Getting a strong pyramid . 46 5 Pyramids contain projective geometries . 50 6 Proof of the polynomial result . 53 4 The Growth Rate Conjecture 57 1 Size functions of classes of matroids . 57 2 The Growth Rate Conjecture . 59 3 Extensions of Kung's Theorem . 61 4 The quadratic conjecture . 65 5 Books . 67 6 Proof of the book result . 69 i ii Contents 7 A spanning clique-minor . 73 8 Support-sets . 73 9 Pseudo-matrices . 78 5 Rota's Conjecture, branch-width and grids 91 1 Rota's Conjecture .
    [Show full text]
  • Count Matroids of Group-Labeled Graphs∗
    Combinatorica 27pp. COMBINATORICA Bolyai Society { Springer-Verlag DOI: 10.1007/s00493-016-3469-8 COUNT MATROIDS OF GROUP-LABELED GRAPHS∗ RINTARO IKESHITA, SHIN-ICHI TANIGAWA Received July 5, 2015 Revised June 29, 2016 A graph G = (V;E) is called (k;`)-sparse if jF j ≤ kjV (F )j − ` for any nonempty F ⊆ E, where V (F ) denotes the set of vertices incident to F . It is known that the family of the edge sets of (k;`)-sparse subgraphs forms the family of independent sets of a matroid, called the (k;`)-count matroid of G. In this paper we shall investigate lifts of the (k;`)- count matroids by using group labelings on the edge set. By introducing a new notion called near-balancedness, we shall identify a new class of matroids whose independence condition is described as a count condition of the form jF j≤kjV (F )j−`+α (F ) for some function α determined by a given group labeling on E. 1. Count matroids A Γ -labeled graph (G; ) is a pair of a directed graph G = (V;E) and an assignment of an element of a group Γ with each oriented edge. Although G is directed, its orientation is used only for the reference of the gains, and we are free to change the orientation of each edge by requiring that if an 1 edge has a label g in one direction, then it has g− in the other direction. Therefore we often do not distinguish between G and the underlying undi- rected graph. By using the group-labeling one can define variants of graphic matroids.
    [Show full text]
  • Recognizing a Class of Bicircular Matroids
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 43 (1993) 197-215 197 North-Holland Recognizing a class of bicircular matroids Collette R. Coullard” School of’ Industriul EnRinrerit?g and Manqemrnt Sciences, Northwestern University, Evnnston. IL 60208. USA John G. de1 Greco Departmentof Muthmmticcd Sciences, Loyola University of Chicago, Chicugo, IL 60626, USA Donald K. Wagner** Division of Muthrmutical Sciences. Of&e of Nawl Rrserrrch, Arlington, VA 22217. USA: and Depart- ment ofOperutions Research und Applied Statistics. George Mason University. F&$.x, VA 22030, USA Received 16 November 1989 Revised 31 May 1991 Abstract Coullard, C.R., J.G. de1 Greco and D.K. Wagner, Recognizing a class of bicircular matroids, Discrete Applied Mathematics 43 (1993) 1977215. This paper presents a polynomial-time algorithm for solving a restricted version of the recognition problem for bicircular matroids. Given a matroid M, the problem is to determine whether M is bicircu- lar. Chandru, Coullard and Wagner showed that this problem is NP-hard in general. The main tool in the development of the algorithm as well as the main theoretical contribution of the paper is a set of necessary and sufficient conditions for a given matroid to be the bicircular matroid of a given graph. As a final result, the complexity result of Chandru et al. is strenghtened. Correspondence to: Professor J.G. de1 Greco, Department of Mathematics, Loyola University of Chicago, Chicago, IL 60626, USA. * Research partially supported by Office of Naval Research Grant N00014-8&K-0689 at Purdue University and National Science Foundation Presidential Young Investigators Grant DDM-8957880 at Northwestern University.
    [Show full text]