Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
42 Publications
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19017 | 
Glock, S., Kim, J., Lichev, L., Pikhurko, O., & Sun, S. (2025). On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7. Canadian Journal of Mathematics. Cambridge University Press. https://doi.org/10.4153/s0008414x25000021
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18478 |
Anastos, M., Boyadzhiyska, S., Rathke, S., & Rué, J. (2025). On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2024.10.002
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19440 |
Alon, Y., & Anastos, M. (2025). The completion numbers of hamiltonicity and pancyclicity in random graphs. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21286
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19418 |
Draganić, N., & Petrova, K. H. (2025). Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.70116
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19554 |
Glasgow, Margalit, A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society 111 (4). 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, Sofiya, The semi-random tree process. European Journal of Combinatorics 126. 2025
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
Lill, Jonas, Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 | Published | Journal Article | IST-REx-ID: 19002 |
Cortés, P. P., Kumar, P., Moore, B., Ossona de Mendez, P., & Quiroz, D. A. (2025). Subchromatic numbers of powers of graphs with excluded minors. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.114377
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 |
Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (2025). Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00636-4
[Published Version]
View
| DOI
| Download Published Version (ext.)
2025 | Published | Journal Article | IST-REx-ID: 19433 |
Anastos, M., Jin, Z., Kwan, M. A., & Sudakov, B. (2025). Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2024.144
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18157 |
Brunck, F. R., & Kwan, M. A. (2025). Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer. Springer Nature. https://doi.org/10.1007/s00283-024-10358-x
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
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 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 |
Anastos, M., & Morris, P. (2025). A note on finding large transversals efficiently. Journal of Combinatorial Designs. Wiley. https://doi.org/10.1002/jcd.21990
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19859 |
Lichev, L., & Schapira, B. (2025). Color-avoiding percolation on the Erdős–Rényi random graph. Annales Henri Lebesgue. École normale supérieure de Rennes. https://doi.org/10.5802/ahl.228
[Published Version]
View
| Files available
| DOI
| 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
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19503 |
Christoph, M., Petrova, K. H., & Steiner, R. (2025). A note on digraph splitting. Combinatorics Probability and Computing. Cambridge University Press. https://doi.org/10.1017/S0963548325000045
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15163 |
Campbell, R., Hörsch, F., & Moore, B. (2024). Decompositions into two linear forests of bounded lengths. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.113962
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 18559 |
Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2024). High-girth Steiner triple systems. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2024.200.3.4
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18702 |
Anastos, M., Auerbach, B., Baig, M. A., Cueto Noval, M., Kwan, M. A., Pascual Perez, G., & Pietrzak, K. Z. (2024). The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In 22nd International Conference on Theory of Cryptography (Vol. 15364, pp. 413–443). Milan, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-78011-0_14
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Journal Article | IST-REx-ID: 18655 |
Anastos, M., Diskin, S., Elboim, D., & Krivelevich, M. (2024). Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. Duke University Press. https://doi.org/10.1214/24-ECP639
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv