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.
7 Publications
2025 | Published | Journal Article | IST-REx-ID: 18753 | 
Carbonero, A., Koerts, H., Moore, B., & Spirkl, S. (2025). On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2024.104104
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, S., & Lichev, L. (2025). The semi-random tree process. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104120
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Dvořák, Z., Moore, B., Seifrtová, M., & Šámal, R. (2025). Precoloring extension in planar near-Eulerian-triangulations. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104138
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 |
| 
|
Mies, S., Moore, B., & Smith-Roberge, E. (2025). Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104214
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20490 |
Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., & Saghafian, M. (2025). Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104248
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
Boyadzhiyska, S., Das, S., Lesgourgues, T., & Petrova, K. H. (2025). Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104235
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |
Greenhill, C., Isaev, M., Kwan, M. A., & McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2017.02.003
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv