Let A be a set and let A be a collection of subsets of A. Conditions are given that must hold if a partition of A is a subset of A. The main idea presented is a generalization of several methods that have been used to prove certain packing theorems
An integer packing set is a set of non-negative integer vectors with the property that, if a vector ...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
Let $E_1 ,\cdots,E_m $ be subsets of a set $V$ of size $n$, such that each element of $V$ is in at m...
Let A be a set and let A be a collection of subsets of A. Conditions are given that must hold if a p...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
Let K be a compact subset ofRn, 0 6 s 6 n. Let P s0, Ps denote s-dimensional packing premeasure and ...
AbstractIn a recent paper, Amini et al. introduced a general framework to prove duality theorems bet...
Modern categorical logic as well as the Kripke and topological models of intuitionistic logic sugges...
We study packing densities for set partitions, which is a generalization of packing words. We use re...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Par...
AbstractA partition graph is an intersection graph for a collection of subsets of auniversal set S w...
We obtain a formula for the essential supremum of the packing dimensions of the sections of sets par...
AbstractLet G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of ...
Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of e...
An integer packing set is a set of non-negative integer vectors with the property that, if a vector ...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
Let $E_1 ,\cdots,E_m $ be subsets of a set $V$ of size $n$, such that each element of $V$ is in at m...
Let A be a set and let A be a collection of subsets of A. Conditions are given that must hold if a p...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
Let K be a compact subset ofRn, 0 6 s 6 n. Let P s0, Ps denote s-dimensional packing premeasure and ...
AbstractIn a recent paper, Amini et al. introduced a general framework to prove duality theorems bet...
Modern categorical logic as well as the Kripke and topological models of intuitionistic logic sugges...
We study packing densities for set partitions, which is a generalization of packing words. We use re...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Par...
AbstractA partition graph is an intersection graph for a collection of subsets of auniversal set S w...
We obtain a formula for the essential supremum of the packing dimensions of the sections of sets par...
AbstractLet G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of ...
Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of e...
An integer packing set is a set of non-negative integer vectors with the property that, if a vector ...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
Let $E_1 ,\cdots,E_m $ be subsets of a set $V$ of size $n$, such that each element of $V$ is in at m...
DOI
Add to ORKG