Two remarks concerning balanced matroids
From MaRDI portal
Publication:879171
DOI10.1007/s00493-006-0039-5zbMath1121.05027arXivmath/0404200OpenAlexW2093375603MaRDI QIDQ879171
Publication date: 8 May 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0404200
Steiner systems in finite geometry (51E10) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45)
Related Items (9)
Correlation bounds for fields and matroids ⋮ On the number of matroids ⋮ A method to construct all the paving matroids over a finite set ⋮ Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid ⋮ The Tutte polynomial of some matroids ⋮ On the structure of the \(h\)-vector of a paving matroid ⋮ Generalized loop‐erased random walks and approximate reachability ⋮ Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids ⋮ Approximately counting bases of bicircular matroids
This page was built for publication: Two remarks concerning balanced matroids