Poset limits can be totally ordered

E. Szemerédi, Regular partitions of graphs , Proc. Colloq. Int. CNRS, Paris, 1976, pp. 309–401

1976

Earlier work this paper cites.

M. Simonovits and V. T. Sós, Szemerédi’s partition and quasirandomness , Random Struct. Algorithms 2

1991

Earlier work this paper cites.

H. J. Prömel, A. Steger, and A. Taraz, Counting partial orders with a fixed number of comparable pairs , Combin. Probab. Computing 10

2001

Earlier work this paper cites.

L. Lovász and B. Szegedy, Limits of dense graph sequences , J. Combin. Theory (B) 96

2006

Earlier work this paper cites.

V. I. Bogachev, Measure theory , Springer, Berlin, 2007

2007

Earlier work this paper cites.

by same author, Szemerédi’s Lemma for the analyst , Geom. Func. Analysis 17

2007

Earlier work this paper cites.

A. Razborov, Flag algebras , J. Symb. Logic 72

2007

Earlier work this paper cites.

T. Tao, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma , J. Anal. Math. 103

2007

Cited alongside, same era.

T. Austin, On exchangeable random variables and the statistics of large graphs and hypergraphs , Probab. Surv. 5

2008

Cited alongside, same era.

C. Borgs, J. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing , Adv. Math. 219

2008

Cited alongside, same era.

P. Diaconis and S. Janson, Graph limits and exchangeable random graphs , Rendiconti di Matematica 28

2008

Cited alongside, same era.

V. Patel, Partitions of combinatorial structures , PhD Thesis, London School of Economics, 2009

2009

Cited alongside, same era.

R. Diestel, Graph theory , 4th ed., Springer, Berlin, 2010

2010

Later among the works it cites.

B. Szegedy, Gowers norms, regularization and limits of functions on abelian groups , E-Print arxiv.org:1010.6211

2010

Later among the works it cites.

C. Hoppen, Y. Kohayakawa, C. G. Moreira, and R. M. Sampaio, Limits of permutation sequences through permutation regularity , E-Print arXiv.org:1106.1663

2011

Later among the works it cites.

S. Janson, Posets limits and exchangeable random posets , Combinatorica 31

2011

Later among the works it cites.

G. Elek and B. Szegedy, A measure-theoretic approach to the theory of dense hypergraphs , Adv. Math. 231

2012

Closest in time.

by same author, Limits of interval orders and semiorders , J. Combinatorics 3