Deletion and contraction operations on lattices enriched with a generating set were introduced by the author in [arXiv:2112.04600]; and from these a notion of minors. When applied to the lattice of flats of a graph, these correspond to the same operations applied to the graph when the vertices are labeled and the edges unlabeled, followed by simplifying the resultant graph. We introduce a partial ordering of the minors of a given generator enriched lattice which we call the minor poset. We show that the minor poset of any generator enriched lattice is isomorphic to the face poset of a regular CW sphere, and in particular, is Eulerian. Furthermore, inequalities for the coefficients of cd-indices of minor posets are established. We also give ...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2,...
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the lit...
We study the structure of the partially ordered set of minors of an arbitrary function of several va...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2,...
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the lit...
We study the structure of the partially ordered set of minors of an arbitrary function of several va...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceA graph H is an induced minor of a graph G if it can be obtained from an induc...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
International audienceWe explore lattice structures on integer binary relations (i.e. binary relatio...
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2,...