A family F of sets is s-disjointly representable if there is a family L of disjoint sets each of size s such that every F ∈ F contains some S ∈ L. Let f(r, s) be the minimum size of a family F of r-sets which is not s-disjointly representable. We give upper and lower bounds on f(r, s) which are within a constant factor when s is fixed. © 2003 Elsevier Science (USA). All rights reserved
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
The thesis is concerned with a number of problems in Combinatorial Set Theory. The Generalized Conti...
International audienceLet F be a family of permutations on [n] = {1, . . . , n} and let Y = {y1 , . ...
AbstractA family F of sets is s-disjointly representable if there is a family S of disjoint sets eac...
AbstractA family F of sets is s-disjointly representable if there is a family S of disjoint sets eac...
A family $F$ of subsets of $[n]$ is called $s$-saturated if it contains no $s$ pairwise disjoint set...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
A family $F$ of subsets of $[n]$ is called $s$-saturated if it contains no $s$ pairwise disjoint set...
AbstractA family F of k-subsets of an n-set X is disjoint union-free (DUF) if all disjoint pairs of ...
AbstractFor any given integers s, d and m (large with respect to s and d) tight bounds are given for...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
AbstractLetr⩾3 be an integer. A weak (r,Δ)-system is a family ofrsets such that all pairwise interse...
Article in Mathematical Proceedings of the Cambridge Philosophical Society 93(01) · Jan...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
A subfamily F ′ of a set family F is said to q-represent F if for every A ∈ F and B of size q such t...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
The thesis is concerned with a number of problems in Combinatorial Set Theory. The Generalized Conti...
International audienceLet F be a family of permutations on [n] = {1, . . . , n} and let Y = {y1 , . ...
AbstractA family F of sets is s-disjointly representable if there is a family S of disjoint sets eac...
AbstractA family F of sets is s-disjointly representable if there is a family S of disjoint sets eac...
A family $F$ of subsets of $[n]$ is called $s$-saturated if it contains no $s$ pairwise disjoint set...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
A family $F$ of subsets of $[n]$ is called $s$-saturated if it contains no $s$ pairwise disjoint set...
AbstractA family F of k-subsets of an n-set X is disjoint union-free (DUF) if all disjoint pairs of ...
AbstractFor any given integers s, d and m (large with respect to s and d) tight bounds are given for...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
AbstractLetr⩾3 be an integer. A weak (r,Δ)-system is a family ofrsets such that all pairwise interse...
Article in Mathematical Proceedings of the Cambridge Philosophical Society 93(01) · Jan...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
A subfamily F ′ of a set family F is said to q-represent F if for every A ∈ F and B of size q such t...
Let M = (E, I) be a matroid and let S = {S1,..., St} be a family of subsets of E of size p. A subfam...
The thesis is concerned with a number of problems in Combinatorial Set Theory. The Generalized Conti...
International audienceLet F be a family of permutations on [n] = {1, . . . , n} and let Y = {y1 , . ...
DOI
Add to ORKG