The highly connected matroids in minor-closed classes

DOI10.1007/s00026-015-0251-3zbMath1310.05044arXiv1312.5012OpenAlexW1973793988MaRDI QIDQ2343467

Jim Geelen, Bert Gerards, Geoffrey P. Whittle

Publication date: 5 May 2015

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5012

zbMATH Keywords

linear codesgrowth rateconnectivitymatroidsgirthminorsML threshold function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Connectivity (05C40)

Related Items (21)

Matrix representations of frame and lifted-graphic matroids correspond to gain functions ⋮ Enumeration of extensions of the cycle matroid of a complete graph ⋮ Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ On graphic elementary lifts of graphic matroids ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Bounding and stabilizing realizations of biased graphs with a fixed group ⋮ The structure of matroids with a spanning clique or projective geometry ⋮ Templates for Binary Matroids ⋮ The templates for some classes of quaternary matroids ⋮ On excluded minors for classes of graphical matroids ⋮ The Highly Connected Even-Cycle and Even-Cut Matroids ⋮ Computing girth and cogirth in perturbed graphic matroids ⋮ The extremal functions of classes of matroids of bounded branch-width ⋮ Unnamed Item ⋮ On perturbations of highly connected dyadic matroids ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Describing quasi-graphic matroids ⋮ On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ The Extremal Function for Excluding Geometry Minors over Prime Fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Densities of minor-closed graph families
• On linear systems with integral valued solutions
• Girth in graphs
• Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
• Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
• Some open problems on excluding a uniform matroid
• Growth rates of minor-closed classes of matroids
• Decomposition and optimization over cycles in binary matroids
• The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
• Biased graphs. II: The three matroids
• On maximum-sized near-regular and \(\root 6\of{1}\)-matroids
• Cliques in dense GF(\(q\))-representable matroids
• On minor-closed classes of matroids with exponential growth rate
• Growth rate functions of dense classes of representable matroids
• Projective geometries in dense matroids
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• On the Error-Correcting Capabilities of Cycle Codes of Graphs
• A Decomposition Theory for Binary Linear Codes
• The intractability of computing the minimum distance of a code

This page was built for publication: The highly connected matroids in minor-closed classes