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.
42 Publications
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.)
| 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: 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
| 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
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19554 |
Glasgow, Margalit, A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society 111 (4). 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, Sofiya, The semi-random tree process. European Journal of Combinatorics 126. 2025
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
Lill, Jonas, Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
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
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 |
L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Random zero-sum dynamic games on infinite directed graphs,” Dynamic Games and Applications. Springer Nature, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
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
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18157 |
F. R. Brunck and M. A. Kwan, “Books, Hallways, and social butterflies: A note on sliding block puzzles,” Mathematical Intelligencer, vol. 47. Springer Nature, pp. 52–65, 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 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 |
M. Anastos and P. Morris, “A note on finding large transversals efficiently,” Journal of Combinatorial Designs. Wiley, 2025.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| 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
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Z. Dvořák, B. Moore, M. Seifrtová, and R. Šámal, “Precoloring extension in planar near-Eulerian-triangulations,” European Journal of Combinatorics, vol. 127. Elsevier, 2025.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19503 |
M. Christoph, K. H. Petrova, and R. Steiner, “A note on digraph splitting,” Combinatorics Probability and Computing. Cambridge University Press, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15163 |
R. Campbell, F. Hörsch, and B. Moore, “Decompositions into two linear forests of bounded lengths,” Discrete Mathematics, vol. 347, no. 6. Elsevier, 2024.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 18559 |
M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “High-girth Steiner triple systems,” Annals of Mathematics, vol. 200, no. 3. Princeton University, pp. 1059–1156, 2024.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18702 |
M. Anastos et al., “The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging,” in 22nd International Conference on Theory of Cryptography, Milan, Italy, 2024, vol. 15364, pp. 413–443.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Journal Article | IST-REx-ID: 18655 |
M. Anastos, S. Diskin, D. Elboim, and M. Krivelevich, “Climbing up a random subgraph of the hypercube,” Electronic Communications in Probability, vol. 29. Duke University Press, 2024.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv