Small Cocircuits in Minimally Vertically 4-Connected Matroids

DOI10.1137/21M1454869MaRDI QIDQ5048306zbMATH OpenOpenAlexFDO

Authors Zach Walsh, James Oxley

Publication date 15 November 2022

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cocircuitsmatroidsvertical connectivity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Extremal problems in graph theory (05C35) Connectivity (05C40) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Abstract: Halin proved that every minimally $k$-connected graph has a vertex of degree $k$. More generally, does every minimally vertically $k$-connected matroid have a $k$-element cocircuit? Results of Murty and Wong give an affirmative answer when $kle3$. We show that every minimally vertically $4$-connected matroid with at least six elements has a $4$-element cocircuit, or a $5$-element cocircuit that contains a triangle, with the exception of a specific non-binary $9$-element matroid. Consequently, every minimally vertically $4$-connected binary matroid with at least six elements has a $4$-element cocircuit.

Recommendations

• Asymptotic equivalence of density estimation and Gaussian white noise
• Asymptotic equivalence for pure jump Lévy processes with unknown Lévy density and Gaussian white noise
• Asymptotic nonequivalence of density estimation and Gaussian white noise for small densities
• The Le Cam distance between density estimation, Poisson processes and Gaussian white noise
• Equivalence theory for density estimation, Poisson processes and Gaussian white noise with drift

Cites work

• Connectivity in Matroids
• Extremal critically connected matroids
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• J. J. Thomson
• On certain n-connected matroids.
• On minimally \(k\)-connected matroids
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Zur Struktur minimal n-fach zusammenhängender Graphen

Cited in

(9)

• The Le Cam distance between density estimation, Poisson processes and Gaussian white noise
• On critical circuits in \(k\)-connected matroids
• Equivalence theory for density estimation, Poisson processes and Gaussian white noise with drift
• Asymptotic nonequivalence of density estimation and Gaussian white noise for small densities
• A complement to Le Cam's theorem
• On elements in small cocircuits in minimally k-connected graphs and matroids
• Characterizing cocircuits in splitting matroids representable over prime field \(\mathrm{GF}(p) \)
• Asymptotic equivalence for pure jump Lévy processes with unknown Lévy density and Gaussian white noise
• On minimally \(k\)-connected matroids

This page was built for publication: Small Cocircuits in Minimally Vertically 4-Connected Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048306)