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.




39 Publications

2025 | In Press | 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 (n.d.).
[Published Version] View | DOI | Download Published Version (ext.)
 
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.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
Books, Hallways, and social butterflies: A note on sliding block puzzles
Brunck, Florestan R, Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer 47. 2025
[Published Version] View | Files available | DOI | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 | OA
Random zero-sum dynamic games on infinite directed graphs
Attia, Luc, Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 2025
[Published Version] View | DOI | Download Published Version (ext.)
 
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: 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 | 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 | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19503
A note on digraph splitting
Christoph, Micha, A note on digraph splitting. Combinatorics Probability and Computing. 2025
[Published Version] View | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Anastos, Michael, Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma 13. 2025
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
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
 
2025 | Published | Journal Article | IST-REx-ID: 19018 | OA
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
 
2025 | Published | Journal Article | IST-REx-ID: 18753 | OA
On heroes in digraphs with forbidden induced forests
Carbonero, Alvaro, On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics 125. 2025
[Published Version] View | Files available | DOI | 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
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.)
 
2024 | Published | Journal Article | IST-REx-ID: 15163 | OA
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
 
2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
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
 
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
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.)
 
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18951 | OA
Local dimer dynamics in higher dimensions
Hartarsky, Ivailo, Local dimer dynamics in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions. 2024
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
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
 
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).
[Published Version] View | Files available | DOI | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
The inertia bound is far from tight
M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Export / Embed