ISTA Research Explorer

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.

Matthew Kwan

Aleksandr Grebennikov

Zhihan Jin

Lenka Kopfova

Kalina Petrova

Farhood Rostamkhani

Yiting Wang

Michael Anastos

Florestan Brunck

Oliver Cooley

Lyuben Lichev

Walner Mendonça

Benjamin Moore

59 Publications

Search / Filter

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

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

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

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

M. Anastos, J. Erde, M. Kang, and V. Pfenninger, “A short proof of a central limit theorem for the order of the giant component and k-core,” Bulletin of the London Mathematical Society, vol. 58, no. 8. Wiley, 2026.

[Published Version] View | Files available | DOI | arXiv

V. Jain, M. A. Kwan, and M. Michelen, “Entangled states are typically incomparable,” Communications in Mathematical Physics, vol. 407, no. 10. Springer, 2026.

L. Hollom, L. Lichev, A. Mond, J. Portier, and Y. Wang, “Approximate Itai–Zehavi conjecture for random graphs,” Random Structures and Algorithms, vol. 69, no. 2. Wiley, 2026.

[Published Version] View | Files available | DOI | arXiv

A. Grebennikov and M. A. Kwan, “No‐(k+1)‐in‐line problem for large constant k,” Bulletin of the London Mathematical Society, vol. 58, no. 10. Wiley, 2026.

[Published Version] View | Files available | DOI

L. Hollom, L. Lichev, A. Mond, J. Portier, and Y. Wang, “Monotonicity and decompositions of random regular graphs,” Annals of Applied Probability, vol. 36, no. 5. Institute of Mathematical Statistics, pp. 4716–4738, 2026.

[Published Version] View | Files available | DOI | arXiv

2026 | Epub ahead of print | Journal Article | IST-REx-ID: 23158 |

L. Hollom, L. Lichev, A. Mond, and J. Portier, “A note on high-dimensional discrepancy of subtrees,” Discrete and Computational Geometry. Springer, 2026.

[Preprint] View | DOI | Download Preprint (ext.) | 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

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: 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

Kwan Group

Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

Alumni

59 Publications

Search

Filter Publications

Display / Sort

Export / Embed

Kwan Group

Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

Alumni

59 Publications

Search

Filter Publications

Display / Sort

Export / Embed

Export Options