12 problems

Let $K_t$ denote the complete graph on $t$ vertices, and let a graph exclude $K_t$ as a minor if it has no graph minor isomorphic to $K_t$. The dimension of a poset $P$, denoted…

A poset has a planar diagram if its cover graph can be drawn in the plane with every cover relation represented by a curve directed upwards. Its cover graph is the graph whose vert…

For positive integers $n_1,\ldots,n_r$, let $\mathbf{n_i}$ denote a chain of length $n_i$, and let a lattice be nice when every stable-partition type dominates only types that are…

Let $B_n$ be the Boolean algebra of all subsets of $[n]$, ordered by inclusion. A chain decomposition of $B_n$ has a type, namely the partition obtained by rearranging its chain si…

Let $P$ be a poset, and let $\mathop{}\\!\operatorname{extsat}(n,P)$ denote the minimum size of an external $P$-saturated family for the Boolean lattice ${\mathcal B}_n$, as define…

A poset is Gorenstein when it is Cohen--Macaulay and Eulerian. Its $cd$-index is denoted by $\Phi_P(c,d)$; coefficientwise comparison means comparison of the coefficients of corres…

Let $C$ be a finite Coxeter group, equipped with its weak order. A ranked poset is strongly Sperner if, for every positive integer $r$, the maximum size of a union of $r$ antichain…

Almost-tiling conjecture. There exists a constant $c=c(P)$ such that for every positive integer $n$, there is a set $S\subseteq 2^{[n]}$ with $|S|\leq c$ such that…

Lonc's conjecture. If $n$ is sufficiently large and $|P|$ divides $2^n-2$, then

Let $P$ be a finite poset, let $|P|$ denote its number of elements, and let $\dim(P)$ denote its order dimension. For a positive integer $m$, let $S_m$ be the standard example on…

Consecutive-layer conjecture. For any fixed poset $P$,

A standard example of dimension $m$ is the poset formed by the one-element subsets and the $(m-1)$-element subsets of an $m$-element set, ordered by inclusion. Standard-example con…