177 research outputs found
Short rainbow cycles in graphs and matroids
Let be a simple -vertex graph and be a colouring of with
colours, where each colour class has size at least . We prove that
contains a rainbow cycle of length at most ,
which is best possible. Our result settles a special case of a strengthening of
the Caccetta-H\"aggkvist conjecture, due to Aharoni. We also show that the
matroid generalization of our main result also holds for cographic matroids,
but fails for binary matroids.Comment: 9 pages, 2 figure
Ribbon graphs and bialgebra of Lagrangian subspaces
To each ribbon graph we assign a so-called L-space, which is a Lagrangian
subspace in an even-dimensional vector space with the standard symplectic form.
This invariant generalizes the notion of the intersection matrix of a chord
diagram. Moreover, the actions of Morse perestroikas (or taking a partial dual)
and Vassiliev moves on ribbon graphs are reinterpreted nicely in the language
of L-spaces, becoming changes of bases in this vector space. Finally, we define
a bialgebra structure on the span of L-spaces, which is analogous to the
4-bialgebra structure on chord diagrams.Comment: 21 pages, 13 figures. v2: major revision, Sec 2 and 3 completely
rewritten; v3: minor corrections. Final version, to appear in Journal of Knot
Theory and its Ramification
A characterization of the base-matroids of a graphic matroid
Let be a matroid on a set and one of its bases. A closed set is saturated with respect to when , where is the rank of . The collection of subsets of such that for every closed saturated set turns out to be the family of independent sets of a new matroid on , called base-matroid and denoted by . In this paper we prove that a graphic matroid , isomorphic to a cycle matroid , is isomorphic to , for every base of , if and only if is direct sum of uniform graphic matroids or, in equivalent way, if and only if is disjoint union of cacti. Moreover we characterize simple binary matroids isomorphic to , with respect to an assigned base
A characterization of the base-matroids of a graphic matroid
Let be a matroid on a set and one of its bases. A closed set is saturated with respect to when , where is the rank of . The collection of subsets of such that for every closed saturated set turns out to be the family of independent sets of a new matroid on , called base-matroid and denoted by . In this paper we prove that a graphic matroid , isomorphic to a cycle matroid , is isomorphic to , for every base of , if and only if is direct sum of uniform graphic matroids or, in equivalent way, if and only if is disjoint union of cacti. Moreover we characterize simple binary matroids isomorphic to , with respect to an assigned base
Locally finite graphs with ends: A topological approach, I. Basic theory
AbstractThis paper is the first of three parts of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. The first two parts of the survey together provide a suitable entry point to this field for new readers; they are available in combined form from the ArXiv [18]. They are complemented by a third part [28], which looks at the theory from an algebraic-topological point of view.The topological approach indicated above has made it possible to extend to locally finite graphs many classical theorems of finite graph theory that do not extend verbatim. While the second part of this survey [19] will concentrate on those applications, this first part explores the new theory as such: it introduces the basic concepts and facts, describes some of the proof techniques that have emerged over the past 10 years (as well as some of the pitfalls these proofs have in stall for the naive explorer), and establishes connections to neighbouring fields such as algebraic topology and infinite matroids. Numerous open problems are suggested
On Selected Subclasses of Matroids
Matroids were introduced by Whitney to provide an abstract notion of independence.
In this work, after giving a brief survey of matroid theory, we describe structural results for various classes of matroids. A connected matroid is unbreakable if, for each of its flats , the matroid is connected%or, equivalently, if has no two skew circuits. . Pfeil showed that a simple graphic matroid is unbreakable exactly when is either a cycle or a complete graph. We extend this result to describe which graphs are the underlying graphs of unbreakable frame matroids. A laminar family is a collection \A of subsets of a set such that, for any two intersecting sets, one is contained in the other. For a capacity function on \A, let \I be %the set \{I:|I\cap A| \leq c(A)\text{ for all A\in\A}\}. Then \I is the collection of independent sets of a (laminar) matroid on . We characterize the class of laminar matroids by their excluded minors and present a way to construct all laminar matroids using basic operations. %Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid is Hamiltonian if it has a spanning circuit. A matroid is nested if its Hamiltonian flats form a chain under inclusion; is laminar if, for every -element independent set , the Hamiltonian flats of containing form a chain under inclusion. We generalize these notions to define the classes of -closure-laminar and -laminar matroids. The second class is always minor-closed, and the first is if and only if . We give excluded-minor characterizations of the classes of 2-laminar and 2-closure-laminar matroids
Bicircular Matroids with Circuits of at Most Two Sizes
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicardinal Matroids and Finite Geometries in 1968, was the first to study matroids with all hyperplanes having the same size. Murty called such a matroid an ``Equicardinal Matroid\u27\u27. Young renamed such a matroid a ``Matroid Design\u27\u27. Further work on determining properties of these matroids was done by Edmonds, Murty, and Young in their papers published in 1972, 1973, and 1970 respectively. These authors were able to connect the problem of determining the matroid designs with specified parameters with results on balanced incomplete block designs. The dual of a matroid design is one in which all circuits have the same size. In 1971, Murty restricted his attention to binary matroids and was able to characterize all connected binary matroids having circuits of a single size. Lemos, Reid, and Wu in 2010, provided partial information on the class of connected binary matroids having circuits of two different sizes. They also shothat there are many such matroids. In general, there are not many results that specify the matroids with circuits of just a few different sizes. Cordovil, Junior, and Lemos provided such results on matroids with small circumference. Here we determine the connected bicircular matroids with all circuits having the same size. We also provide structural information on the connected bicircular matroids with circuits of two different sizes. The bicircular matroids considered are in general non-binary. Hence these results are a start on extending Murty\u27s characterization of binary matroid designs to non-binary matroids
- …