Title of article
Connected coverings and an application to oriented matroids Original Research Article
Author/Authors
David Forge، نويسنده , , J.L. Rami´rez Alfonsi´n، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
13
From page
109
To page
121
Abstract
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.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951070
Link To Document