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. 2026. Counting perfect matchings in Dirac hypergraphs. Combinatorica. 46, 5.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21884 |
Morawski P, Petrova KH. 2026. Randomly perturbed digraphs also have bounded-degree spanning trees. Electronic Journal of Combinatorics. 33(2), P2.24.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20422 |
|
|
Christoph M, Nenadov R, Petrova KH. 2026. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 176, 254–267.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20482 |
|
|
Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. 2026. Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. 131, 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, 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. 2025. The exact rank of sparse random graphs. Journal of the European Mathematical Society.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 21706 |
|
|
Kwan MA, Sauermann L. 2025. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica. 161(12), 3089–3139.
[Published Version]
View
| Files available
| DOI
| 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. 360, 506–511.
[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. 125, 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. 2025. Subchromatic numbers of powers of graphs with excluded minors. Discrete Mathematics. 348(4), 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. 2025. On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7. Canadian Journal of Mathematics., 1–43.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19018 |
Burova S, Lichev L. 2025. The semi-random tree process. European Journal of Combinatorics. 126, 104120.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19418 |
Draganić N, Petrova KH. 2025. Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. 111(3), e70116.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19433 |
Anastos M, Jin Z, Kwan MA, Sudakov B. 2025. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 13, e55.
[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. 66(2), e21286.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19503 |
Christoph M, Petrova KH, Steiner R. 2025. A note on digraph splitting. Combinatorics Probability and Computing. 34(4), 559–564.
[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. 2025. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 15, 1517–1535.
[Published Version]
View
| Files available
| DOI
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 19554 |
Glasgow M, Kwan MA, Sah A, Sawhney M. 2025. A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society. 111(4), e70101.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19603 |
Lill J, Petrova KH, Weber S. 2025. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 87, 983–1007.
[Published Version]
View
| Files available
| DOI
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 19798 |
Anastos M, Morris P. 2025. A note on finding large transversals efficiently. Journal of Combinatorial Designs. 33(9), 338–342.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv