Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6 Publications
2023 | Journal Article | IST-REx-ID: 13042 | 
M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 11740 |
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.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12286 |
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.
[Published Version]
View
| Files available
| DOI
| WoS
2015 | Journal Article | IST-REx-ID: 1642 |
R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
[Published Version]
View
| Files available
| DOI
| arXiv
2014 | Journal Article | IST-REx-ID: 9594 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv