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.

17 Publications


2024 | Journal Article | IST-REx-ID: 15163 | OA
R. Campbell, F. Hörsch, and B. Moore, “Decompositions into two linear forests of bounded lengths,” Discrete Mathematics, vol. 347, no. 6. Elsevier, 2024.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 13042 | OA
M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Journal Article | IST-REx-ID: 14319 | OA
M. Anastos, D. Fabian, A. Müyesser, and T. Szabó, “Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets,” Electronic Journal of Combinatorics, vol. 30, no. 3. Electronic Journal of Combinatorics, 2023.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14344 | OA
M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 11706 | OA
A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” Random Structures and Algorithms, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023.
[Published Version] View | Files available | DOI | WoS
 

2023 | Journal Article | IST-REx-ID: 14444 | OA
M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 14499 | OA
M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14867 | OA
M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,” in Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Prague, Czech Republic, 2023, pp. 36–41.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Journal Article | IST-REx-ID: 15173 | OA
M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” Comptes Rendus Mathematique, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 11186 | OA
M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,” Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp. 1420–1438, 2022.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11145 | OA
A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” in 62nd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022, pp. 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 10775 | OA
A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 11443 | OA
M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” Transactions of the American Mathematical Society, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 11740 | OA
O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” Electronic Journal of Combinatorics, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 12151 | OA
O. Cooley, M. Kang, and O. Pikhurko, “On a question of Vera T. Sós about size forcing of graphons,” Acta Mathematica Hungarica, vol. 168. Springer Nature, pp. 1–26, 2022.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12432
M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.
View | DOI | WoS
 

2022 | Journal Article | IST-REx-ID: 12286 | OA
O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=MaKw

Search

Filter Publications