Connected coverings and an application to oriented matroids

In this paper we are interested in the following question: what is the smallest number of circuits, s(n,r), that is sufficient to determine every uniform oriented matroid of rank r on n elements? We shall give different upper bounds for s(n,r) by using special coverings called connected coverings.

Bibliographic Details

Published in:	Discrete mathematics Vol. 187; no. 1; pp. 109 - 121
Main Authors:	Forge, David, Alfonsi´n, J.L. Rami´rez
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06-06-1998
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!