Transversal Theory and Matroids
Dominic Welsh
Abstract
Open-access reader
Dominic Welsh
Abstract
Open-access reader
In this paper I use techniques developed by Mirsky and Perfect ( 5 ) to generalize the extremely close relationship between transversal theory and the theory of matroids or independence structures. I extend in two directions a fundamental theorem of Rado ( 8 ) and use the techniques of Mirsky and Perfect to obtain easy proofs of known and unknown results about systems of representatives with repetition. 2. Basic concepts. In this section I review the results used subsequently. Throughout the paper, S will denote a finite set and A will denote the collection of subsets of S, {A i i ∈ I }, where I is a finite index set. |K| will denote the cardinality of a set K and I use the notation
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper I use techniques developed by Mirsky and Perfect ( 5 ) to generalize the extremely close relationship between transversal theory and the theory of matroids or independence structures. I extend in two directions a fundamental theorem of Rado ( 8 ) and use the techniques of Mirsky and Perfect to obtain easy proofs of known and unknown results about systems of representatives with repetition. 2. Basic concepts. In this section I review the results used subsequently. Throughout the paper, S will denote a finite set and A will denote the collection of subsets of S, {A i i ∈ I }, where I is a finite index set. |K| will denote the cardinality of a set K and I use the notation
Key concepts: Mathematics, Matroid, Cardinality (data modeling), Transversal (combinatorics), Mathematical proof, Notation, Section (typography), Set (abstract data type)