Equitable matroids

MaRDI QIDQ2500960zbMATH OpenFDO

Authors Dillon Mayhew

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/126662, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r41.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

Summary: One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate the class of matroids having the property that this procedure yields a basis uniformly at random. We show how this class is related to some other naturally-defined families of matroids and consider how it behaves under well-known matroid operations.

Recommendations

• On Random Representable Matroids
• scientific article; zbMATH DE number 1070707
• Exact expectation and variance of minimal basis of random matroids
• scientific article; zbMATH DE number 952958
• Approximating the number of bases for almost all matroids

This page was built for publication: Equitable matroids

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