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.
17 Publications
2024 | Journal Article | IST-REx-ID: 15163 | 
Campbell, R., Hörsch, F., & Moore, B. (2024). Decompositions into two linear forests of bounded lengths. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.113962
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 13042 |
Anastos, M. (2023). A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14319 |
Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14344 |
Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 11706 |
Liebenau, A., Mattos, L., Mendonca dos Santos, W., & Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21106
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 14444 |
Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 14499 |
Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14867 |
Anastos, M. (2023). Constructing Hamilton cycles and perfect matchings efficiently. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications (pp. 36–41). Prague, Czech Republic: Masaryk University Press. https://doi.org/10.5817/cz.muni.eurocomb23-005
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Journal Article | IST-REx-ID: 15173 |
Kwan, M. A., Sah, A., & Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences. https://doi.org/10.5802/crmath.423
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 11186 |
Kwan, M. A., Sah, A., & Sawhney, M. (2022). Large deviations in random latin squares. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12638
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Conference Paper | IST-REx-ID: 11145 |
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. https://doi.org/10.1109/FOCS52979.2021.00075
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10775 |
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3148779
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11443 |
Kwan, M. A., Sauermann, L., & Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/8614
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11740 |
Cooley, O., Del Giudice, N., Kang, M., & Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/10607
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12151 |
Cooley, O., Kang, M., & Pikhurko, O. (2022). On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. Springer Nature. https://doi.org/10.1007/s10474-022-01265-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Conference Paper | IST-REx-ID: 12432
Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091
View
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 12286 |
Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/10794
[Published Version]
View
| Files available
| DOI
| WoS