Add to ORKGBy the assistance of an independence space on a set S with finite rank, this paper presents a way to determine a family of subsets of S to possess an independent transversal. Afterwards, it provides another result on infinite transversal relative to partial transversals of a family of subsets of S. The two results are in the field of transversal theory
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...
AbstractA well-known condition sufficient for the existence of a transversal of a family of sets is ...
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...
AbstractThe main theorem of this memorandum gives necessary and sufficient conditions for an infinit...
AbstractLet M = (S, I) be a matroid of finite character on the infinite set S. Let A = 〈A1:i ∈ I〉 be...
In [2] we proved a necessary and sufficient condition for a family of sets to possess a transversal....
AbstractA k-transversal of a family of sets H is a function g: H → [∪ H]k + 1 satisfying |∪ g[F]| ⩾ ...
AbstractLet U be a family of sets having a finite number of infinte members. A proof is given for a ...
In this note we show by a simple direct proof that Folkman’s necessary and sufficient condition for ...
AbstractIn this note we show by a simple direct proof that Folkman's necessary and sufficient condit...
AbstractThere are two conditions which are known to be necessary for the existence of a transversal ...
AbstractA well-known condition sufficient for the existence of a transversal of a family of sets is ...
AbstractThis paper proves a conjecture of C. St. J. A. Nash-Williams giving necessary and sufficient...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
AbstractA family of hypergraphs is exhibited which have the property that the minimum cardinality of...
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...
AbstractA well-known condition sufficient for the existence of a transversal of a family of sets is ...
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...
AbstractThe main theorem of this memorandum gives necessary and sufficient conditions for an infinit...
AbstractLet M = (S, I) be a matroid of finite character on the infinite set S. Let A = 〈A1:i ∈ I〉 be...
In [2] we proved a necessary and sufficient condition for a family of sets to possess a transversal....
AbstractA k-transversal of a family of sets H is a function g: H → [∪ H]k + 1 satisfying |∪ g[F]| ⩾ ...
AbstractLet U be a family of sets having a finite number of infinte members. A proof is given for a ...
In this note we show by a simple direct proof that Folkman’s necessary and sufficient condition for ...
AbstractIn this note we show by a simple direct proof that Folkman's necessary and sufficient condit...
AbstractThere are two conditions which are known to be necessary for the existence of a transversal ...
AbstractA well-known condition sufficient for the existence of a transversal of a family of sets is ...
AbstractThis paper proves a conjecture of C. St. J. A. Nash-Williams giving necessary and sufficient...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
AbstractA family of hypergraphs is exhibited which have the property that the minimum cardinality of...
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...
AbstractA well-known condition sufficient for the existence of a transversal of a family of sets is ...
AbstractA family of s subsets of a finite set R is a partitioning family of R if the subsets are pai...