… In this section, we compare UM-graphs with known bound graphs of posets. The relations
between UB and DB-graphs were first discussed in [6]. However, some of their results have …

… In this paper, we consider upper bound graphs and double bound graphs of posets. … bound
graphs whose complements are also upper bound graphs as follows: for a connected graph …

… invariant for the covering graph of a poset is found. … We also know that a cp embeddable
poset must be a TBU-poset, … Moreover it is graded and each s E L has at most 2 upper covers. …

… In order to obtain these results we introduce the graph of full differences of a ring and study
… However, we will investigate solely incidence rings, which are built over a finite poset. Then …

… With r denoting the maximum vertex degree in the incomparability graph of P, … bound holds
for all posets. We give a negative answer using a randomized construction of bipartite posets …

… poset is a family of vector spaces indexed by the poset elements with a homomorphism for
each poset … a directed acyclic graph, but the relation need not be transitive. An example in the …

… in graphs, the above definition of saturation for posets extends … If a poset Q does not contain
a target poset P as a subposet, … 2 Upper bounds on induced saturation numbers, 3 Lower …

… whose vertex set is given by the set of elements of a poset, and edges join … Under the ETH,
we provide a stronger lower bound than the one for planar graphs (which … 2 Upper Bounds …

… In light of the fact that only roughly half of the countries have a fiscal rule in place, we show
both the distribution of the full sample and the corresponding plots excluding observations …