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.
52 Publications
2026 |
Published |
Journal Article |
IST-REx-ID: 21159 |
| 
|
Kwan MA, Safavi Hemami R, Wang Y. Counting perfect matchings in Dirac hypergraphs. Combinatorica. 2026;46. doi:10.1007/s00493-025-00194-8
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21884 |
Morawski P, Petrova KH. Randomly perturbed digraphs also have bounded-degree spanning trees. Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/13316
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20422 |
|
|
Christoph M, Nenadov R, Petrova KH. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 2026;176:254-267. doi:10.1016/j.jctb.2025.09.002
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20482 |
|
|
Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. 2026;131. doi:10.1016/j.ejc.2025.104235
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Submitted |
Preprint |
IST-REx-ID: 21211 |
Montgomery R, Petrova KH, Ranganathan A, Tan J. Packing subdivisions into regular graphs. arXiv. doi:10.48550/arXiv.2508.00480
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 21263 |
|
|
Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs. Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1692
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 21706 |
|
|
Kwan MA, Sauermann L. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica. 2025;161(12):3089-3139. doi:10.1112/S0010437X25102789
[Published Version]
View
| Files available
| DOI
| arXiv
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: 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: 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: 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: 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: 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 |
Published |
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;15:1517-1535. doi:10.1007/s13235-025-00636-4
[Published Version]
View
| Files available
| DOI
| 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 |
Published |
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;87:983-1007. doi:10.1007/s00453-025-01306-y
[Published Version]
View
| Files available
| DOI
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 19798 |
Anastos M, Morris P. A note on finding large transversals efficiently. Journal of Combinatorial Designs. 2025;33(9):338-342. doi:10.1002/jcd.21990
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv