Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
21 Publications
2023 | Published | Journal Article | IST-REx-ID: 11706 |
Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms. Wiley, 2023. https://doi.org/10.1002/rsa.21106.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Published | Conference Paper | IST-REx-ID: 14867 |
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 36–41. Masaryk University Press, 2023. https://doi.org/10.5817/cz.muni.eurocomb23-005.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 15173 |
Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique. Academie des Sciences, 2023. https://doi.org/10.5802/crmath.423.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14319 |
Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14344 |
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch88.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14444 |
Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2513-9.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14499 |
Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 10775 |
Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.” IEEE Transactions on Information Theory. IEEE, 2022. https://doi.org/10.1109/TIT.2022.3148779.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 17077 |
Ferber, Asaf, Matthew Alan Kwan, Bhargav Narayanan, Ashwin Sah, and Mehtaab Sawhney. “Friendly Bisections of Random Graphs.” Communications of the American Mathematical Society. American Mathematical Society, 2022. https://doi.org/10.1090/cams/13.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 12151 |
Cooley, Oliver, M. Kang, and O. Pikhurko. “On a Question of Vera T. Sós about Size Forcing of Graphons.” Acta Mathematica Hungarica. Springer Nature, 2022. https://doi.org/10.1007/s10474-022-01265-8.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 12286 |
Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2022. https://doi.org/10.37236/10794.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Published | Conference Paper | IST-REx-ID: 12432
Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.
View
| DOI
| WoS
2022 | Published | Conference Paper | IST-REx-ID: 11145 |
Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.” In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022. https://doi.org/10.1109/FOCS52979.2021.00075.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11186 |
Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Large Deviations in Random Latin Squares.” Bulletin of the London Mathematical Society. Wiley, 2022. https://doi.org/10.1112/blms.12638.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11443 |
Kwan, Matthew Alan, Lisa Sauermann, and Yufei Zhao. “Extension Complexity of Low-Dimensional Polytopes.” Transactions of the American Mathematical Society. American Mathematical Society, 2022. https://doi.org/10.1090/tran/8614.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11740 |
Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2022. https://doi.org/10.37236/10607.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv