M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13042
DOI: 10.37236/11471
WoS: 000988285500001
arXiv: 2105.13828

M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14319
DOI: 10.37236/11714
arXiv: 2212.03100

O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” Electronic Journal of Combinatorics, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11740
DOI: 10.37236/10607
WoS: 000836200300001
arXiv: 2005.07103

O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12286
DOI: 10.37236/10794
WoS: 000876763300001

R. Fulek, J. Kyndl, I. Malinovid, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1642
DOI: 10.37236/5002
arXiv: 1305.4519

C. Greenhill, M. A. Kwan, and D. Wind, “On the number of spanning trees in random regular graphs,” The Electronic Journal of Combinatorics, vol. 21, no. 1. The Electronic Journal of Combinatorics, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/9594
DOI: 10.37236/3752
arXiv: 1309.6710