On perturbations of highly connected dyadic matroids
From MaRDI portal
Publication:1787962
DOI10.1007/s00026-018-0396-yzbMath1396.05021arXiv1712.07702OpenAlexW3099644352MaRDI QIDQ1787962
Kevin Grace, Stefan H. M. Van Zwam
Publication date: 5 October 2018
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07702
templatesperturbationscounterexampleconnectivitymatroidsminorsextremal functiondyadicmatroid structure
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)
Related Items (5)
The templates for some classes of quaternary matroids ⋮ The Highly Connected Even-Cycle and Even-Cut Matroids ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids ⋮ The Extremal Function for Excluding Geometry Minors over Prime Fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Girth in graphs
- Growth rates of minor-closed classes of matroids
- Signed graphs
- Cliques in dense GF(\(q\))-representable matroids
- Biased graphs whose matroids are special binary matroids
- The highly connected matroids in minor-closed classes
- Matroids denser than a clique
- Projective geometries in dense matroids
- Decompositions of signed-graphic matroids
- Templates for Binary Matroids
- On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes
- An Obstacle to a Decomposition Theorem for Near-Regular Matroids
- Small vertex-transitive graphs of given degree and girth
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
This page was built for publication: On perturbations of highly connected dyadic matroids