✦ LIBER ✦

Poset limits and exchangeable random posets

✍ Scribed by Svante Janson

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 436 KB
Volume: 31
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-011-2591-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval number of special posets and ra

Interval number of special posets and random posets

✍ Tom Madej; Douglas B. West 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

The interval number i(P) of a poset P is the smallest t such that P is a containment poset of sets that are unions of at most t real intervals. For the special poset Bn(k) consisting of the singletons and k-subsets of an n-element set, ordered by inclusion, i(B~(k))---min{k,nk + 1} if In~2-kl >~ n/2

B-posets, FS-posets and Relevant Categor

B-posets, FS-posets and Relevant Categories

✍ Xuxin Mao; Luoshan Xu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 335 KB

First order properties of random posets

✍ Tomasz Łuczak 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 397 KB

Let LB = s2(n, p) be a binary relation on the set [n] = { 1, ?, , n} such that Se(i, i) for every i and W(i,j) with probability p, independently for each pair i, j E [n], where i <j. Define < as the transitive closure of W and denote poset ([n], <) by R(n, p). We show that for any constant p probabi

The Symmetrical Exchange Property for Po

The Symmetrical Exchange Property for Poset Matroids

✍ M. Barnabei; G. Nicoletti; L. Pezzoli 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Incidence codes of posets: Eulerian pose

Incidence codes of posets: Eulerian posets and Reed-Muller codes

✍ Kenneth P. Bogart 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 713 KB

This paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. In the case that the partial:; ordered set is Eulertan the length of the code is the number of elements in the poset, the dimension is the size of a sePected order ideal and the minimum distance is the minimu

Posets and planar graphs

✍ Stefan Felsner; William T. Trotter 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract Usually __dimension__ should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [__t__ − 1 ↕ __t__], thought to be between __t__ − 1 and __t__. We have the following two results: (a) a graph is outerplanar if and only if its