Loading...
Please wait, while we are loading the content...
Similar Documents
Poset limits can be totally ordered.
| Content Provider | CiteSeerX |
|---|---|
| Author | Hladky, Jan Patel, Viresh Pikhurko, Oleg |
| Abstract | S. Janson [Poset limits and and exchangeable random posets, Combinatorica 31 (2011), 529–563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a kernel on the unit interval with the standard order, thus answering an open question of Janson. We provide two proofs: real-analytic and combinatorial. The combinatorial proof is based on a Szemerédi-type Regularity Lemma for posets which may be of independent interest. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Poset Limit Totally Ordered Dense Graph Independent Interest Open Question Unit Interval Poset Limit Combinatorial Proof Finite Posets Szemer Di-type Regularity Lemma Janson Poset Limit Standard Order Exchangeable Random Posets |
| Content Type | Text |
