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.
53 Publications
2026 |
Published |
Journal Article |
IST-REx-ID: 21159 |
| 
|
M. A. Kwan, R. Safavi Hemami, and Y. Wang, “Counting perfect matchings in Dirac hypergraphs,” Combinatorica, vol. 46. Springer Nature, 2026.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21884 |
P. Morawski and K. H. Petrova, “Randomly perturbed digraphs also have bounded-degree spanning trees,” Electronic Journal of Combinatorics, vol. 33, no. 2. Electronic Journal of Combinatorics, 2026.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20422 |
|
|
M. Christoph, R. Nenadov, and K. H. Petrova, “The Hamilton space of pseudorandom graphs,” Journal of Combinatorial Theory Series B, vol. 176. Elsevier, pp. 254–267, 2026.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 20482 |
|
|
S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers of complete bipartite graphs,” European Journal of Combinatorics, vol. 131. Elsevier, 2026.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 22147 |
|
|
Z. Hunter, M. A. Kwan, L. Sauermann, and M. Sawhney, “On random matrices with large corank,” International Mathematics Research Notices, vol. 2026, no. 12. Oxford University Press, 2026.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Submitted |
Preprint |
IST-REx-ID: 21211 |
R. Montgomery, K. H. Petrova, A. Ranganathan, and J. Tan, “Packing subdivisions into regular graphs,” arXiv. .
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 21706 |
|
|
M. A. Kwan and L. Sauermann, “Resolution of the quadratic Littlewood–Offord problem,” Compositio Mathematica, vol. 161, no. 12. Cambridge University Press, pp. 3089–3139, 2025.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 18478 |
M. Anastos, S. Boyadzhiyska, S. Rathke, and J. Rué, “On the chromatic number of powers of subdivisions of graphs,” Discrete Applied Mathematics, vol. 360. Elsevier, pp. 506–511, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 18753 |
A. Carbonero, H. Koerts, B. Moore, and S. Spirkl, “On heroes in digraphs with forbidden induced forests,” European Journal of Combinatorics, vol. 125. Elsevier, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19002 |
P. P. Cortés, P. Kumar, B. Moore, P. Ossona de Mendez, and D. A. Quiroz, “Subchromatic numbers of powers of graphs with excluded minors,” Discrete Mathematics, vol. 348, no. 4. Elsevier, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 19017 |
S. Glock, J. Kim, L. Lichev, O. Pikhurko, and S. 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, pp. 1–43, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19018 |
S. Burova and L. Lichev, “The semi-random tree process,” European Journal of Combinatorics, vol. 126. Elsevier, 2025.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19418 |
N. Draganić and K. H. Petrova, “Size‐Ramsey numbers of graphs with maximum degree three,” Journal of the London Mathematical Society, vol. 111, no. 3. Wiley, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19433 |
M. Anastos, Z. Jin, M. A. Kwan, and B. Sudakov, “Extremal, enumerative and probabilistic results on ordered hypergraph matchings,” Forum of Mathematics, Sigma, vol. 13. Cambridge University Press, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19440 |
Y. Alon and M. Anastos, “The completion numbers of hamiltonicity and pancyclicity in random graphs,” Random Structures and Algorithms, vol. 66, no. 2. Wiley, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19503 |
M. Christoph, K. H. Petrova, and R. Steiner, “A note on digraph splitting,” Combinatorics Probability and Computing, vol. 34, no. 4. Cambridge University Press, pp. 559–564, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19554 |
M. Glasgow, M. A. Kwan, A. Sah, and M. Sawhney, “A central limit theorem for the matching number of a sparse random graph,” Journal of the London Mathematical Society, vol. 111, no. 4. Wiley, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19603 |
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” Algorithmica, vol. 87. Springer Nature, pp. 983–1007, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 19798 |
M. Anastos and P. Morris, “A note on finding large transversals efficiently,” Journal of Combinatorial Designs, vol. 33, no. 9. Wiley, pp. 338–342, 2025.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19859 |
L. Lichev and B. Schapira, “Color-avoiding percolation on the Erdős–Rényi random graph,” Annales Henri Lebesgue, vol. 8. École normale supérieure de Rennes, pp. 35–65, 2025.
[Published Version]
View
| Files available
| DOI
| arXiv