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 | 
On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7
S. Glock, J. Kim, L. Lichev, O. Pikhurko, S. Sun, Canadian Journal of Mathematics (2025) 1–43.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
S. Glock, J. Kim, L. Lichev, O. Pikhurko, S. Sun, Canadian Journal of Mathematics (2025) 1–43.
2025 | Published | Journal Article | IST-REx-ID: 18478 |
On the chromatic number of powers of subdivisions of graphs
M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2025) 506–511.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2025) 506–511.
2025 | Published | Journal Article | IST-REx-ID: 19440 |
The completion numbers of hamiltonicity and pancyclicity in random graphs
Y. Alon, M. Anastos, Random Structures and Algorithms 66 (2025).
[Published Version]
View
| Files available
| DOI
| arXiv
Y. Alon, M. Anastos, Random Structures and Algorithms 66 (2025).
2025 | Published | Journal Article | IST-REx-ID: 19418 |
Size‐Ramsey numbers of graphs with maximum degree three
N. Draganić, K.H. Petrova, Journal of the London Mathematical Society 111 (2025).
[Published Version]
View
| Files available
| DOI
| arXiv
N. Draganić, K.H. Petrova, Journal of the London Mathematical Society 111 (2025).
2025 | Published | Journal Article | IST-REx-ID: 19554 |
A central limit theorem for the matching number of a sparse random graph
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
Glasgow, Margalit, A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society 111 (4). 2025
2025 | Published | Journal Article | IST-REx-ID: 19018 |
The semi-random tree process
Burova, Sofiya, The semi-random tree process. European Journal of Combinatorics 126. 2025
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
Burova, Sofiya, The semi-random tree process. European Journal of Combinatorics 126. 2025
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
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.)
Lill, Jonas, Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025
2025 | Published | Journal Article | IST-REx-ID: 19002 |
Subchromatic numbers of powers of graphs with excluded minors
P.P. Cortés, P. Kumar, B. Moore, P. Ossona de Mendez, D.A. Quiroz, Discrete Mathematics 348 (2025).
[Published Version]
View
| Files available
| DOI
| arXiv
P.P. Cortés, P. Kumar, B. Moore, P. Ossona de Mendez, D.A. Quiroz, Discrete Mathematics 348 (2025).
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 |
Random zero-sum dynamic games on infinite directed graphs
L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications (2025).
[Published Version]
View
| DOI
| Download Published Version (ext.)
L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications (2025).
2025 | Published | Journal Article | IST-REx-ID: 19433 |
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13 (2025).
[Published Version]
View
| Files available
| DOI
| arXiv
M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13 (2025).
2025 | Published | Journal Article | IST-REx-ID: 18157 |
Books, Hallways, and social butterflies: A note on sliding block puzzles
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer 47 (2025) 52–65.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer 47 (2025) 52–65.
2025 | Published | Journal Article | IST-REx-ID: 18753 |
On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 |
A note on finding large transversals efficiently
M. Anastos, P. Morris, Journal of Combinatorial Designs (2025).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Anastos, P. Morris, Journal of Combinatorial Designs (2025).
2025 | Published | Journal Article | IST-REx-ID: 19859 |
Color-avoiding percolation on the Erdős–Rényi random graph
L. Lichev, B. Schapira, Annales Henri Lebesgue 8 (2025) 35–65.
[Published Version]
View
| Files available
| DOI
| arXiv
L. Lichev, B. Schapira, Annales Henri Lebesgue 8 (2025) 35–65.
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Precoloring extension in planar near-Eulerian-triangulations
Z. Dvořák, B. Moore, M. Seifrtová, R. Šámal, European Journal of Combinatorics 127 (2025).
[Published Version]
View
| Files available
| DOI
| arXiv
Z. Dvořák, B. Moore, M. Seifrtová, R. Šámal, European Journal of Combinatorics 127 (2025).
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19503 |
A note on digraph splitting
M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing (2025).
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing (2025).
2024 | Published | Journal Article | IST-REx-ID: 15163 |
Decompositions into two linear forests of bounded lengths
R. Campbell, F. Hörsch, B. Moore, Discrete Mathematics 347 (2024).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
R. Campbell, F. Hörsch, B. Moore, Discrete Mathematics 347 (2024).
2024 | Published | Journal Article | IST-REx-ID: 18559 |
High-girth Steiner triple systems
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Annals of Mathematics 200 (2024) 1059–1156.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Annals of Mathematics 200 (2024) 1059–1156.
2024 | Published | Conference Paper | IST-REx-ID: 18702 |
The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.
[Preprint]
View
| DOI
| Download Preprint (ext.)
M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.
2024 | Published | Journal Article | IST-REx-ID: 18655 |
Climbing up a random subgraph of the hypercube
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).