24 research outputs found
Forbidden subposet problems in the grid
For posets and , extremal and saturation problems about weak and
strong -free subposets of have been studied mostly in the case is
the Boolean poset , the poset of all subsets of an -element set ordered
by inclusion. In this paper, we study some instances of the problem with
being the grid, and its connections to the Boolean case and to the forbidden
submatrix problem
Poset Ramsey number . III. N-shaped poset
Given partially ordered sets (posets) and , we
say that contains a copy of if for some injective function and for any , if and only if
. For any posets and , the poset Ramsey number
is the least positive integer such that no matter how the elements
of an -dimensional Boolean lattice are colored in blue and red, there is
either a copy of with all blue elements or a copy of with all red
elements.
We focus on the poset Ramsey number for a fixed poset and an
-dimensional Boolean lattice , as grows large. It is known that
, for positive constants and .
However, there is no poset known, for which , for
. This paper is devoted to a new method for finding upper bounds
on using a duality between copies of and sets of elements
that cover them, referred to as blockers. We prove several properties of
blockers and their direct relation to the Ramsey numbers. Using these
properties we show that , for a poset
with four elements and , such that , ,
, and the remaining pairs of elements are incomparable.Comment: 19 pages, 6 figure
Forbidden subposet problems in the grid
For posets P and Q, extremal and saturation problems about weak and strong P-free subposets of Q have been studied mostly in the case Q is the Boolean poset Qn, the poset of all subsets of an n-element set ordered by inclusion. In this paper, we study some instances of the problem with Q being the grid, and its connections to the Boolean case and to the forbidden submatrix problem
Combinatorics of Topological Posets:\ Homotopy complementation formulas
We show that the well known {\em homotopy complementation formula} of
Bj\"orner and Walker admits several closely related generalizations on
different classes of topological posets (lattices). The utility of this
technique is demonstrated on some classes of topological posets including the
Grassmannian and configuration posets, and
which were introduced and studied by V.~Vassiliev. Among other
applications we present a reasonably complete description, in terms of more
standard spaces, of homology types of configuration posets which
leads to a negative answer to a question of Vassilev raised at the workshop
``Geometric Combinatorics'' (MSRI, February 1997)
Problems in extremal graphs and poset theory
In this dissertation, we present three different research topics and results regarding such topics. We introduce partially ordered sets (posets) and study two types of problems concerning them-- forbidden subposet problems and induced-poset-saturation problems. We conclude by presenting results obtained from studying vertex-identifying codes in graphs.
In studying forbidden subposet problems, we are interested in estimating the maximum size of a family of subsets of the -set avoiding a given subposet. We provide a lower bound for the size of the largest family avoiding the poset, which makes use of error-correcting codes. We also provide and upper and lower bound results for a -uniform hypergraph that avoids a \emph{triangle}. Ferrara et al. introduced the concept of studying the minimum size of a family of subsets of the -set avoiding an induced poset, called induced-poset-saturation. In particular, the authors provided a lower bound for the size of an induced-antichain poset and we improve on their lower bound result.
Let be a graph with vertex set and edge set . For any nonnegative integer , let denote the ball of radius around vertex . For a finite graph , an -vertex-identifying code in is a subset , with the property that , for all distinct and , for all . We study graphs with large symmetric differences and -jumbled graphs and estimate the minimum size of a vertex-identifying code in each graph
Poset Ramsey number . III. Chain Compositions and Antichains
An induced subposet of a poset is a subset of
such that for every two , if and only if . The Boolean lattice of dimension is the poset consisting of all
subsets of ordered by inclusion. Given two posets and
the poset Ramsey number is the smallest integer such
that in any blue/red coloring of the elements of there is either a
monochromatically blue induced subposet isomorphic to or a
monochromatically red induced subposet isomorphic to .
We provide upper bounds on for two classes of : parallel
compositions of chains, i.e.\ posets consisting of disjoint chains which are
pairwise element-wise incomparable, as well as subdivided , which are
posets obtained from two parallel chains by adding a common minimal and a
common maximal element. This completes the determination of for
posets with at most elements. If is an antichain on
elements, we show that for .
Additionally, we briefly survey proof techniques in the poset Ramsey setting
versus .Comment: 20 pages, 23 figures. Merged with arXiv:2205.0227