Geodesic
On the diameter of matroid ports
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A clutter or antichain on a set defines a hypergraph. Matroid ports are a special class of clutters, and this paper deals with the diameter of matroid ports, that is, the diameter of the corresponding hypergraphs. Specifically, we prove that the diameter of every matroid port is at most $2$. The main interest of our result is its application to secret sharing. Brickell and Davenport proved in 1989 that the minimal qualified subsets of every ideal secret sharing scheme form a matroid port. Therefore, our result provides a new necessary condition for an access structure to admit an ideal secret sharing scheme.
DOI : 10.37236/902
Classification : 94A62, 52B40 
@article{10_37236_902,
     author = {Jaume Mart{\'\i}-Farr\'e and Carles Padr\'o and Leonor V\'azquez},
     title = {On the diameter of matroid ports},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/902},
     zbl = {1159.94007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/902/}
}
TY  - JOUR
AU  - Jaume Martí-Farré
AU  - Carles Padró
AU  - Leonor Vázquez
TI  - On the diameter of matroid ports
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/902/
DO  - 10.37236/902
ID  - 10_37236_902
ER  - 
%0 Journal Article
%A Jaume Martí-Farré
%A Carles Padró
%A Leonor Vázquez
%T On the diameter of matroid ports
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/902/
%R 10.37236/902
%F 10_37236_902
Jaume Martí-Farré; Carles Padró; Leonor Vázquez. On the diameter of matroid ports. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/902

Cité par Sources :