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, Stefan, Jaehoon Kim, Lyuben Lichev, Oleg Pikhurko, and Shumin Sun. “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, 2025. https://doi.org/10.4153/s0008414x25000021.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18478 |
Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics. Elsevier, 2025. 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, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms. Wiley, 2025. https://doi.org/10.1002/rsa.21286.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19418 |
Draganić, Nemanja, and Kalina H Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society. Wiley, 2025. 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, Pedro P., Pankaj Kumar, Benjamin Moore, Patrice Ossona de Mendez, and Daniel A. Quiroz. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics. Elsevier, 2025. 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, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications. Springer Nature, 2025. 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, Michael, Zhihan Jin, Matthew Alan Kwan, and Benny Sudakov. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma. Cambridge University Press, 2025. https://doi.org/10.1017/fms.2024.144.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18157 |
Brunck, Florestan R, and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer. Springer Nature, 2025. 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, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics. Elsevier, 2025. 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, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs. Wiley, 2025. https://doi.org/10.1002/jcd.21990.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19859 |
Lichev, Lyuben, and Bruno Schapira. “Color-Avoiding Percolation on the Erdős–Rényi Random Graph.” Annales Henri Lebesgue. École normale supérieure de Rennes, 2025. https://doi.org/10.5802/ahl.228.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Dvořák, Zdeněk, Benjamin Moore, Michaela Seifrtová, and Robert Šámal. “Precoloring Extension in Planar Near-Eulerian-Triangulations.” European Journal of Combinatorics. Elsevier, 2025. 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, Micha, Kalina H Petrova, and Raphael Steiner. “A Note on Digraph Splitting.” Combinatorics Probability and Computing. Cambridge University Press, 2025. https://doi.org/10.1017/S0963548325000045.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15163 |
Campbell, Rutger, Florian Hörsch, and Benjamin Moore. “Decompositions into Two Linear Forests of Bounded Lengths.” Discrete Mathematics. Elsevier, 2024. 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, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “High-Girth Steiner Triple Systems.” Annals of Mathematics. Princeton University, 2024. 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, Michael, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Alan Kwan, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” In 22nd International Conference on Theory of Cryptography, 15364:413–43. Springer Nature, 2024. 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, Michael, Sahar Diskin, Dor Elboim, and Michael Krivelevich. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability. Duke University Press, 2024. https://doi.org/10.1214/24-ECP639.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv