Erdős number

1. Erdős, P., Kierstead, H. A., & Trotter, W. T. (1991). The dimension of random ordered sets. Random Structures & Algorithms, 2(3), 253-275.

2. Kierstead, H.A., & Rabern, L. (2020). Improved lower bounds on the number of edges in list critical and online list critical graphs. Journal of Combinatorial Theory, Series B, 140, 147-170.

3. Rabern, L., Rabern, B., & Macauley, M. (2013). Dangerous reference graphs and semantic paradoxes. Journal of Philosophical Logic, 42(5), 727-765.