Related papers: A tight lower bound for the hardness of clutters
A {\it clutter} (or {\it antichain} or {\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Usually, the elements of $V$ are called {\it vertices}…
A family ${\mathcal A} \subset {\mathcal P} [n]$ is said to be an antichain if $A \not \subset B$ for all distinct $A,B \in {\mathcal A}$. A classic result of Sperner shows that such families satisfy $|{\mathcal A}| \leq \binom {n}{\lfloor…
Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…
The toughness of a graph $G$ is defined as the largest real number $t$ such that for any set $S\subseteq V(G)$ such that $G-S$ is disconnected, $S$ has at least $t$ times more elements than $G-S$ has components (unless $G$ is complete, in…
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…
Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…
This paper proves the minimum size of a supersequence over a set of eight elements is 52. This disproves a conjecture that the lower bound of the supersequence is the partial sum of the geometric Connell sequence. By studying the internal…
A clutter is \emph{$k$-wise intersecting} if every $k$ members have a common element, yet no element belongs to all members. We conjecture that, for some integer $k\geq 4$, every $k$-wise intersecting clutter is non-ideal. As evidence for…
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…
An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…
An antichain $\mathcal{A}$ in a poset $\mathcal{P}$ is a subset of $\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\mathcal{B}_n = \left\{ 0 < 1 \right\}^n$, is the…
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. The weight of a cycle cover of an edge-weighted graph is…
We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set, by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral…
In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…
A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is $t$-tough. A graph is minimally $t$-tough if…
A 2-structure on a set $S$ is given by an equivalence relation on the set of ordered pairs of distinct elements of $S$. A subset $C$ of $S$, any two elements of which appear the same from the perspective of each element of the complement of…
A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…
A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…
A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\H{o}s characterised the largest families of subsets of…