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.
47 Publications
2025 | Published | Journal Article | IST-REx-ID: 18478 | 
Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” Discrete Applied Mathematics, vol. 360, Elsevier, 2025, pp. 506–11, doi:10.1016/j.dam.2024.10.002.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18157 |
Brunck, Florestan R., and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer, vol. 47, Springer Nature, 2025, pp. 52–65, doi:10.1007/s00283-024-10358-x.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 18753 |
Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics, vol. 125, 104104, Elsevier, 2025, doi:10.1016/j.ejc.2024.104104.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19859 |
Lichev, Lyuben, and Bruno Schapira. “Color-Avoiding Percolation on the Erdős–Rényi Random Graph.” Annales Henri Lebesgue, vol. 8, École normale supérieure de Rennes, 2025, pp. 35–65, doi:10.5802/ahl.228.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20007 |
Anastos, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19002 |
Cortés, Pedro P., et al. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics, vol. 348, no. 4, 114377, Elsevier, 2025, doi: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 |
Glock, Stefan, et al. “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, pp. 1–43, doi:10.4153/s0008414x25000021.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, Sofiya, and Lyuben Lichev. “The Semi-Random Tree Process.” European Journal of Combinatorics, vol. 126, 104120, Elsevier, 2025, doi:10.1016/j.ejc.2025.104120.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19418 |
Draganić, Nemanja, and Kalina H. Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society, vol. 111, no. 3, e70116, Wiley, 2025, doi:10.1112/jlms.70116.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19440 |
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms, vol. 66, no. 2, e21286, Wiley, 2025, doi:10.1002/rsa.21286.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19433 |
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, doi:10.1017/fms.2024.144.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
Christoph, Micha, et al. “A Note on Digraph Splitting.” Combinatorics Probability and Computing, vol. 34, no. 4, Cambridge University Press, 2025, pp. 559–64, doi:10.1017/S0963548325000045.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19508 |
Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications, Springer Nature, 2025, doi:10.1007/s13235-025-00636-4.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Published | Journal Article | IST-REx-ID: 19554 |
Glasgow, Margalit, et al. “A Central Limit Theorem for the Matching Number of a Sparse Random Graph.” Journal of the London Mathematical Society, vol. 111, no. 4, e70101, Wiley, 2025, doi:10.1112/jlms.70101.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica, Springer Nature, 2025, doi:10.1007/s00453-025-01306-y.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19798 |
Anastos, Michael, and Patrick Morris. “A Note on Finding Large Transversals Efficiently.” Journal of Combinatorial Designs, Wiley, 2025, doi:10.1002/jcd.21990.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Dvořák, Zdeněk, et al. “Precoloring Extension in Planar Near-Eulerian-Triangulations.” European Journal of Combinatorics, vol. 127, 104138, Elsevier, 2025, doi:10.1016/j.ejc.2025.104138.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 |
| 
|
Mies, Sebastian, et al. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” European Journal of Combinatorics, vol. 130, no. 12, 104214, Elsevier, 2025, doi:10.1016/j.ejc.2025.104214.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 |
|
|
Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B, vol. 176, Elsevier, 2025, pp. 254–67, doi:10.1016/j.jctb.2025.09.002.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 20504 |
|
|
Jain, Vishesh, et al. “The Edge-Statistics Conjecture for Hypergraphs.” International Mathematics Research Notices, vol. 2025, no. 18, rnaf273, Oxford University Press, 2025, doi:10.1093/imrn/rnaf273.
[Published Version]
View
| Files available
| DOI
| arXiv