Poset limits can be totally ordered

DOI10.1090/S0002-9947-2015-06299-0zbMath1347.06003arXiv1211.2473OpenAlexW2127771528MaRDI QIDQ5247001

Jan Hladký, András Máthé, Viresh Patel, Oleg Pikhurko

Publication date: 22 April 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.2473

zbMATH Keywords

regularity lemmapartially ordered sethomomorphism densityordered probability spaceposet kernel

Mathematics Subject Classification ID

Partial orders, general (06A06) Total orders (06A05) Classical measure theory (28A99)

Related Items

First order convergence of matroids, Decomposition of tournament limits, Semantic limits of dense combinatorial objects, Limits of \(k\)-dimensional poset sequences, Limits of structures and the example of tree semi-lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• Testing permutation properties through subpermutations
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Limits of permutation sequences
• Limits of interval orders and semiorders
• Moments of two-variable functions and the uniqueness of graph limits
• Poset limits and exchangeable random posets
• Counting Partial Orders with a Fixed Number of Comparable Pairs
• Continuum limits for classical sequential growth models
• Graph limits and exchangeable random graphs
• Szemerédi's partition and quasirandomness
• Flag algebras