A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS

DOI10.1093/QMATH/27.4.407MaRDI QIDQ4141827zbMATH OpenOpenAlexFDO

Authors Paul Seymour

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(21)

• Clutters and circuits
• Matroids Can Be Far from Ideal Secret Sharing
• Clutters and circuits. II
• From clutters to matroids
• A note on the production of matroid minors
• Ideal multipartite secret sharing schemes
• Introduction to secret-sharing
• Bounds on guessing numbers and secret sharing combining information theory methods.
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Operations over linear secret sharing schemes
• Secret sharing schemes for ports of matroids of rank 3.
• A note on squarefree monomial ideals and matroid ports
• The matroids with the max-flow min-cut property
• Ideal hierarchical secret sharing schemes
• From coordinate subspaces over finite fields to ideal multipartite uniform clutters
• New method to compute bounds on the optimal information rate of secret sharing schemes
• On secret sharing schemes, matroids and polymatroids
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
• On combinatorial properties of binary spaces
• Bipartite secret sharing and staircases

This page was built for publication: A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS

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