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

2023 | Journal Article | IST-REx-ID: 14444 | OA
Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2023 | Journal Article | IST-REx-ID: 14499 | OA
Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.
[Published Version] View | Files available | DOI | arXiv
 
2023 | Conference Paper | IST-REx-ID: 14867 | OA
Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications, 36–41.
[Published Version] View | Files available | DOI | arXiv
 
2023 | Journal Article | IST-REx-ID: 15173 | OA
Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Journal Article | IST-REx-ID: 11186 | OA
Kwan MA, Sah A, Sawhney M. 2022. Large deviations in random latin squares. Bulletin of the London Mathematical Society. 54(4), 1420–1438.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Conference Paper | IST-REx-ID: 11145 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022, 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 10775 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 68(6), 3823–3828.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 11443 | OA
Kwan MA, Sauermann L, Zhao Y. 2022. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 375(6), 4209–4250.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 11740 | OA
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. 29(3), P3.27.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 12151 | OA
Cooley O, Kang M, Pikhurko O. 2022. On a question of Vera T. Sós about size forcing of graphons. Acta Mathematica Hungarica. 168, 1–26.
[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. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022–October, 919–930.
View | DOI | WoS
 
2022 | Journal Article | IST-REx-ID: 12286 | OA
Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13.
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

type<>research_data

Search

Filter Publications