A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
From MaRDI portal
Publication:4141827
DOI10.1093/qmath/27.4.407zbMath0366.05022OpenAlexW2095100518MaRDI QIDQ4141827
Publication date: 1976
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/27.4.407
Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ On combinatorial properties of binary spaces ⋮ From clutters to matroids ⋮ Bipartite secret sharing and staircases ⋮ Ideal multipartite secret sharing schemes ⋮ Operations over Linear Secret Sharing Schemes ⋮ Clutters and circuits ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ The matroids with the max-flow min-cut property ⋮ A note on the production of matroid minors ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Introduction to Secret-Sharing ⋮ Clutters and circuits. II ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ Secret sharing schemes for ports of matroids of rank 3
