Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”10.1112/blms.13127__Bulletin of the London Mathematical Society, London Mathematical Society, 2024, doi:10.1112/blms.13127.
LibreCat: https://research-explorer.ista.ac.at/record/17376
DOI: 10.1112/blms.13127
arXiv: 2312.04925

Campbell, Rutger, et al. “Decompositions into Two Linear Forests of Bounded Lengths.”10.1016/j.disc.2024.113962__Discrete Mathematics, vol. 347, no. 6, 113962, Elsevier, 2024, doi:10.1016/j.disc.2024.113962.
LibreCat: https://research-explorer.ista.ac.at/record/15163
DOI: 10.1016/j.disc.2024.113962
arXiv: 2301.11615

Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.”10.1093/qmath/haae030__Quarterly Journal of Mathematics, vol. 75, no. 3, Oxford University Press, 2024, pp. 869–99, doi:10.1093/qmath/haae030.
LibreCat: https://research-explorer.ista.ac.at/record/17475
DOI: 10.1093/qmath/haae030
arXiv: 2309.09788

Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.”10.37236/11471__Electronic Journal of Combinatorics, vol. 30, no. 2, .21, Electronic Journal of Combinatorics, 2023, doi:10.37236/11471.
LibreCat: https://research-explorer.ista.ac.at/record/13042
DOI: 10.37236/11471
WoS: 000988285500001
arXiv: 2105.13828

Anastos, Michael, et al. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.”10.37236/11714__Electronic Journal of Combinatorics, vol. 30, no. 3, .10, Electronic Journal of Combinatorics, 2023, doi:10.37236/11714.
LibreCat: https://research-explorer.ista.ac.at/record/14319
DOI: 10.37236/11714
arXiv: 2212.03100

Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.”10.1137/1.9781611977554.ch88__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2023, Society for Industrial and Applied Mathematics, 2023, pp. 2286–323, doi:10.1137/1.9781611977554.ch88.
LibreCat: https://research-explorer.ista.ac.at/record/14344
DOI: 10.1137/1.9781611977554.ch88
arXiv: 2111.14759

Liebenau, Anita, et al. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.”10.1002/rsa.21106__Random Structures and Algorithms, vol. 62, no. 4, Wiley, 2023, pp. 1035–55, doi:10.1002/rsa.21106.
LibreCat: https://research-explorer.ista.ac.at/record/11706
DOI: 10.1002/rsa.21106
WoS: 000828530400001

Kwan, Matthew Alan, et al. “Substructures in Latin Squares.”10.1007/s11856-023-2513-9__Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
LibreCat: https://research-explorer.ista.ac.at/record/14444
DOI: 10.1007/s11856-023-2513-9
arXiv: 2202.05088

Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erds–McKay Conjecture.”10.1017/fmp.2023.17__Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.
LibreCat: https://research-explorer.ista.ac.at/record/14499
DOI: 10.1017/fmp.2023.17
arXiv: 2208.02874

Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.”10.5817/cz.muni.eurocomb23-005__Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41, doi:10.5817/cz.muni.eurocomb23-005.
LibreCat: https://research-explorer.ista.ac.at/record/14867
DOI: 10.5817/cz.muni.eurocomb23-005
arXiv: 2209.09860

Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.”10.5802/crmath.423__Comptes Rendus Mathematique, vol. 361, no. , Academie des Sciences, 2023, pp. 565–75, doi:10.5802/crmath.423.
LibreCat: https://research-explorer.ista.ac.at/record/15173
DOI: 10.5802/crmath.423
arXiv: 2112.03788

Kwan, Matthew Alan, et al. “Large Deviations in Random Latin Squares.”10.1112/blms.12638__Bulletin of the London Mathematical Society, vol. 54, no. 4, Wiley, 2022, pp. 1420–38, doi:10.1112/blms.12638.
LibreCat: https://research-explorer.ista.ac.at/record/11186
DOI: 10.1112/blms.12638
WoS: 000779920900001
arXiv: 2106.11932

Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.”10.1109/FOCS52979.2021.00075__62nd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022, IEEE, 2022, pp. 720–26, doi:10.1109/FOCS52979.2021.00075.
LibreCat: https://research-explorer.ista.ac.at/record/11145
DOI: 10.1109/FOCS52979.2021.00075
WoS: 000802209600065
arXiv: 2012.10584

Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.”10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory, vol. 68, no. 6, IEEE, 2022, pp. 3823–28, doi:10.1109/TIT.2022.3148779.
LibreCat: https://research-explorer.ista.ac.at/record/10775
DOI: 10.1109/TIT.2022.3148779
WoS: 000799622500022
arXiv: 2012.10584

Kwan, Matthew Alan, et al. “Extension Complexity of Low-Dimensional Polytopes.”10.1090/tran/8614__Transactions of the American Mathematical Society, vol. 375, no. 6, American Mathematical Society, 2022, pp. 4209–50, doi:10.1090/tran/8614.
LibreCat: https://research-explorer.ista.ac.at/record/11443
DOI: 10.1090/tran/8614
WoS: 000798461500001
arXiv: 2006.08836

Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.”10.37236/10607__Electronic Journal of Combinatorics, vol. 29, no. 3, .27, Electronic Journal of Combinatorics, 2022, doi:10.37236/10607.
LibreCat: https://research-explorer.ista.ac.at/record/11740
DOI: 10.37236/10607
WoS: 000836200300001
arXiv: 2005.07103

Cooley, Oliver, et al. “On a Question of Vera T. Sós about Size Forcing of Graphons.”10.1007/s10474-022-01265-8__Acta Mathematica Hungarica, vol. 168, Springer Nature, 2022, pp. 1–26, doi:10.1007/s10474-022-01265-8.
LibreCat: https://research-explorer.ista.ac.at/record/12151
DOI: 10.1007/s10474-022-01265-8
WoS: 000886839900006
arXiv: 2103.09114

Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”10.1109/FOCS54457.2022.00091__63rd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.
LibreCat: https://research-explorer.ista.ac.at/record/12432
DOI: 10.1109/FOCS54457.2022.00091
WoS: 000909382900084

Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.”10.37236/10794__The Electronic Journal of Combinatorics, vol. 29, no. 4, .13, The Electronic Journal of Combinatorics, 2022, doi:10.37236/10794.
LibreCat: https://research-explorer.ista.ac.at/record/12286
DOI: 10.37236/10794
WoS: 000876763300001

Ferber, Asaf, et al. “Friendly Bisections of Random Graphs.”10.1090/cams/13__Communications of the American Mathematical Society, vol. 2, no. 10, American Mathematical Society, 2022, pp. 380–416, doi:10.1090/cams/13.
LibreCat: https://research-explorer.ista.ac.at/record/17077
DOI: 10.1090/cams/13
arXiv: 2105.13337