Loading...
Loading...

Go to the content (press return)

From clutters to matroids

Author
Fàbrega, J.; Martí-Farré, J.; Muñoz, X.
Type of activity
Presentation of work at congresses
Name of edition
VIII Encuentro Andaluz de Matemática Discreta
Date of publication
2013
Presentation's date
2013-10-17
Book of congress proceedings
Avances en Matemática Discreta en Andalucía - Volumen III. VIII Encuentro Andaluz de Matem ´atica Discreta. Sevilla, octubre de 2013
First page
139
Last page
146
Publisher
Universidad de Sevilla
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/21963 Open in new window
Abstract
This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion minimal subsets of the family into the set of circuits of a matroid.
Citation
Fàbrega, J.; Marti, J.; Muñoz, X. From clutters to matroids. A: Encuentro Andaluz de Matemática Discreta. "AVANCES EN MATEMÁTICA DISCRETA EN ANDALUCÍA - Volumen III". Sevilla: Universidad de Sevilla, 2013, p. 139-146.
Keywords
Clutter, antichain, matroid, matroidal completion.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants