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 | OA | PlanS
Kwan, Matthew Alan, Roodabeh Safavi Hemami, and Yiting Wang. “Counting Perfect Matchings in Dirac Hypergraphs.” Combinatorica. Springer Nature, 2026. https://doi.org/10.1007/s00493-025-00194-8.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 21884 | OA
Morawski, Patryk, and Kalina H Petrova. “Randomly Perturbed Digraphs Also Have Bounded-Degree Spanning Trees.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2026. https://doi.org/10.37236/13316.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 20422 | OA | PlanS
Christoph, Micha, Rajko Nenadov, and Kalina H Petrova. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B. Elsevier, 2026. https://doi.org/10.1016/j.jctb.2025.09.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 20482 | OA | PlanS
Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics. Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104235.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22147 | OA | PlanS
Hunter, Zach, Matthew Alan Kwan, Lisa Sauermann, and Mehtaab Sawhney. “On Random Matrices with Large Corank.” International Mathematics Research Notices. Oxford University Press, 2026. https://doi.org/10.1093/imrn/rnag126.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Submitted | Preprint | IST-REx-ID: 21211 | OA
Montgomery, Richard, Kalina H Petrova, Arjun Ranganathan, and Jane Tan. “Packing Subdivisions into Regular Graphs.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2508.00480.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 21706 | OA | PlanS
Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” Compositio Mathematica. Cambridge University Press, 2025. https://doi.org/10.1112/S0010437X25102789.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.dam.2024.10.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18753 | OA
Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2024.104104.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19002 | OA
Cortés, Pedro P., Pankaj Kumar, Benjamin Moore, Patrice Ossona de Mendez, and Daniel A. Quiroz. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics. Elsevier, 2025. https://doi.org/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 | OA
Glock, Stefan, Jaehoon Kim, Lyuben Lichev, Oleg Pikhurko, and Shumin 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, 2025. https://doi.org/10.4153/s0008414x25000021.
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19018 | OA
Burova, Sofiya, and Lyuben Lichev. “The Semi-Random Tree Process.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104120.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, Nemanja, and Kalina H Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society. Wiley, 2025. https://doi.org/10.1112/jlms.70116.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, Zhihan Jin, Matthew Alan Kwan, and Benny Sudakov. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma. Cambridge University Press, 2025. https://doi.org/10.1017/fms.2024.144.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms. Wiley, 2025. https://doi.org/10.1002/rsa.21286.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, Micha, Kalina H Petrova, and Raphael Steiner. “A Note on Digraph Splitting.” Combinatorics Probability and Computing. Cambridge University Press, 2025. https://doi.org/10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
Glasgow, Margalit, Matthew Alan Kwan, Ashwin Sah, and Mehtaab Sawhney. “A Central Limit Theorem for the Matching Number of a Sparse Random Graph.” Journal of the London Mathematical Society. Wiley, 2025. https://doi.org/10.1112/jlms.70101.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19603 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica. Springer Nature, 2025. https://doi.org/10.1007/s00453-025-01306-y.
[Published Version] View | Files available | DOI | WoS
 
2025 | Published | Journal Article | IST-REx-ID: 19798 | OA
Anastos, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs. Wiley, 2025. https://doi.org/10.1002/jcd.21990.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19859 | OA
Lichev, Lyuben, and Bruno Schapira. “Color-Avoiding Percolation on the Erdős–Rényi Random Graph.” Annales Henri Lebesgue. École normale supérieure de Rennes, 2025. https://doi.org/10.5802/ahl.228.
[Published Version] View | Files available | DOI | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed