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.
47 Publications
2025 | Published | Journal Article | IST-REx-ID: 18478 | 
Anastos M, Boyadzhiyska S, Rathke S, Rué J. On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. 2025;360:506-511. doi:10.1016/j.dam.2024.10.002
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18157 |
Brunck FR, Kwan MA. Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer. 2025;47:52-65. doi: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. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 2025;125. doi:10.1016/j.ejc.2024.104104
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19859 |
Lichev L, Schapira B. Color-avoiding percolation on the Erdős–Rényi random graph. Annales Henri Lebesgue. 2025;8:35-65. doi:10.5802/ahl.228
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20007 |
Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19002 |
Cortés PP, Kumar P, Moore B, Ossona de Mendez P, Quiroz DA. Subchromatic numbers of powers of graphs with excluded minors. Discrete Mathematics. 2025;348(4). doi:10.1016/j.disc.2024.114377
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19017 |
Glock S, Kim J, Lichev L, Pikhurko O, Sun S. On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7. Canadian Journal of Mathematics. 2025:1-43. doi:10.4153/s0008414x25000021
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova S, Lichev L. The semi-random tree process. European Journal of Combinatorics. 2025;126. doi:10.1016/j.ejc.2025.104120
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19418 |
Draganić N, Petrova KH. Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. 2025;111(3). doi:10.1112/jlms.70116
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19440 |
Alon Y, Anastos M. The completion numbers of hamiltonicity and pancyclicity in random graphs. Random Structures and Algorithms. 2025;66(2). doi:10.1002/rsa.21286
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19433 |
Anastos M, Jin Z, Kwan MA, Sudakov B. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 2025;13. doi:10.1017/fms.2024.144
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
Christoph M, Petrova KH, Steiner R. A note on digraph splitting. Combinatorics Probability and Computing. 2025;34(4):559-564. doi:10.1017/S0963548325000045
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 |
Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 2025. doi:10.1007/s13235-025-00636-4
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Published | Journal Article | IST-REx-ID: 19554 |
Glasgow M, Kwan MA, Sah A, Sawhney M. A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society. 2025;111(4). doi:10.1112/jlms.70101
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
Lill J, Petrova KH, Weber S. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025. doi:10.1007/s00453-025-01306-y
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 |
Anastos M, Morris P. A note on finding large transversals efficiently. Journal of Combinatorial Designs. 2025. doi:10.1002/jcd.21990
[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. Precoloring extension in planar near-Eulerian-triangulations. European Journal of Combinatorics. 2025;127. doi: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. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 2025;130(12). doi: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: 20422 |
|
|
Christoph M, Nenadov R, Petrova KH. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 2025;176:254-267. doi:10.1016/j.jctb.2025.09.002
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 20504 |
|
|
Jain V, Kwan MA, Mubayi D, Tran T. The edge-statistics conjecture for hypergraphs. International Mathematics Research Notices. 2025;2025(18). doi:10.1093/imrn/rnaf273
[Published Version]
View
| Files available
| DOI
| arXiv