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.

Yiting Wang

Matthew Kwan

Farhood Rostamkhani

Lenka Kopfova

Michael Anastos

Kalina Petrova

Aleksandr Grebennikov

Walner Mendonça

Lyuben Lichev

Florestan Brunck

Oliver Cooley

Benjamin Moore



47 Publications

2025 | Published | Journal Article | IST-REx-ID: 18478 | OA
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
 
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
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
 
2025 | Published | Journal Article | IST-REx-ID: 18753 | OA
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
 
2025 | Published | Journal Article | IST-REx-ID: 19859 | OA
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
 
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Smoothed analysis for graph isomorphism
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19002 | OA
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 | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19017 | OA
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.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19018 | OA
The semi-random tree process
S. Burova, L. Lichev, European Journal of Combinatorics 126 (2025).
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
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 | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
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 | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
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 | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
A note on digraph splitting
M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing 34 (2025) 559–564.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 | OA
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 | Files available | DOI | Download Published Version (ext.) | WoS
 
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
A central limit theorem for the matching number of a sparse random graph
M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the London Mathematical Society 111 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, Algorithmica (2025).
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 | OA
A note on finding large transversals efficiently
M. Anastos, P. Morris, Journal of Combinatorial Designs (2025).
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19879 | OA
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 | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 | OA | PlanS
Beyond the pseudoforest strong Nine Dragon Tree theorem
S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 | OA | PlanS
The Hamilton space of pseudorandom graphs
M. Christoph, R. Nenadov, K.H. Petrova, Journal of Combinatorial Theory Series B 176 (2025) 254–267.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20504 | OA | PlanS
The edge-statistics conjecture for hypergraphs
V. Jain, M.A. Kwan, D. Mubayi, T. Tran, International Mathematics Research Notices 2025 (2025).
[Published Version] View | Files available | DOI | arXiv
 

Search

Filter Publications

Display / Sort

Export / Embed