Related papers: A class of non-matchable distributive lattices

We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…

For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…

The Total Matching Polytope generalizes the Stable Set Polytope and the Matching Polytope. In this paper, we give the perfect formulation for Trees and we derive two new families of valid inequalities, the balanced biclique inequalities…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…

The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equals its maximum degree. Minimum page matching book…

Let $Q$ be a subset of a finite distributive lattice $D$. An algebra $A$ represents the inclusion $Q\subseteq D$ by principal congruences if the congruence lattice of $A$ is isomorphic to $D$ and the ordered set of principal congruences of…

A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…

Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…

For a distributive join-semilattice S with zero, a S-valued poset measure on a poset P is a map m:PxP->S such that m(x,z) <= m(x,y)vm(y,z), and x <= y implies that m(x,y)=0, for all x,y,z in P. In relation with congruence lattice…

We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…

An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\'{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\'{e} set if and only if each spanning tree of $G$ has a…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

For a hypergraph $\mathbb{H}$ on $[n]$, the hypergraphic poset $P_\mathbb{H}$ is the transitive closure of the oriented skeleton of the hypergraphic polytope $\triangle_\mathbb{H}$ (the Minkowski sum of the standard simplices $\triangle_H$…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…