Matthew Alan Kwan

39 Publications

Mark all

[39]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, doi:10.1017/fms.2024.144.
[Published Version] View | Files available | DOI | arXiv
 
[38]
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
Brunck, Florestan R., and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer, vol. 47, Springer Nature, 2025, pp. 52–65, doi:10.1007/s00283-024-10358-x.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[37]
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
Glasgow, Margalit, et al. “A Central Limit Theorem for the Matching Number of a Sparse Random Graph.” Journal of the London Mathematical Society, vol. 111, no. 4, e70101, Wiley, 2025, doi:10.1112/jlms.70101.
[Published Version] View | Files available | DOI | arXiv
 
[36]
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
[Published Version] View | Files available | DOI | arXiv
 
[35]
2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
Kwan, Matthew Alan, et al. “High-Girth Steiner Triple Systems.” Annals of Mathematics, vol. 200, no. 3, Princeton University, 2024, pp. 1059–156, doi:10.4007/annals.2024.200.3.4.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[34]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, doi:10.1007/978-3-031-78011-0_14.
[Preprint] View | DOI | Download Preprint (ext.)
 
[33]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, Michael, et al. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society, vol. 110, no. 6, e70010, Wiley, 2024, doi:10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[32]
2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” Bulletin of the London Mathematical Society, vol. 56, no. 10, London Mathematical Society, 2024, pp. 3196–208, doi:10.1112/blms.13127.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2024 | Published | Journal Article | IST-REx-ID: 17475 | OA
Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.” Quarterly Journal of Mathematics, vol. 75, no. 3, Oxford University Press, 2024, pp. 869–99, doi:10.1093/qmath/haae030.
[Published Version] View | Files available | DOI | arXiv
 
[30]
2023 | Published | Journal Article | IST-REx-ID: 14444 | OA
Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[29]
2023 | Published | Journal Article | IST-REx-ID: 15173 | OA
Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique, vol. 361, no. G2, Academie des Sciences, 2023, pp. 565–75, doi:10.5802/crmath.423.
[Published Version] View | Files available | DOI | arXiv
 
[28]
2023 | Published | Journal Article | IST-REx-ID: 14499 | OA
Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.
[Published Version] View | Files available | DOI | arXiv
 
[27]
2022 | Published | Journal Article | IST-REx-ID: 11186 | OA
Kwan, Matthew Alan, et al. “Large Deviations in Random Latin Squares.” Bulletin of the London Mathematical Society, vol. 54, no. 4, Wiley, 2022, pp. 1420–38, doi:10.1112/blms.12638.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[26]
2022 | Published | Journal Article | IST-REx-ID: 11443 | OA
Kwan, Matthew Alan, et al. “Extension Complexity of Low-Dimensional Polytopes.” Transactions of the American Mathematical Society, vol. 375, no. 6, American Mathematical Society, 2022, pp. 4209–50, doi:10.1090/tran/8614.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[25]
2022 | Published | Journal Article | IST-REx-ID: 17077 | OA
Ferber, Asaf, et al. “Friendly Bisections of Random Graphs.” Communications of the American Mathematical Society, vol. 2, no. 10, American Mathematical Society, 2022, pp. 380–416, doi:10.1090/cams/13.
[Published Version] View | Files available | DOI | arXiv
 
[24]
2022 | Published | Conference Paper | IST-REx-ID: 11145 | OA
Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.” 62nd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022, IEEE, 2022, pp. 720–26, doi:10.1109/FOCS52979.2021.00075.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Published | Journal Article | IST-REx-ID: 10775 | OA
Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.” IEEE Transactions on Information Theory, vol. 68, no. 6, IEEE, 2022, pp. 3823–28, doi:10.1109/TIT.2022.3148779.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9572 | OA
Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” Bulletin of the London Mathematical Society, vol. 53, no. 2, Wiley, 2021, pp. 619–30, doi:10.1112/blms.12446.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Published | Journal Article | IST-REx-ID: 9573 | OA
He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Published | Journal Article | IST-REx-ID: 9576 | OA
Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Journal Article | IST-REx-ID: 9577 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[18]
2020 | Published | Journal Article | IST-REx-ID: 9578 | OA
Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 9581 | OA
Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9582 | OA
Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Published | Journal Article | IST-REx-ID: 9583 | OA
Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 9580 | OA
Conlon, David, et al. “Hypergraph Cuts above the Average.” Israel Journal of Mathematics, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:10.1007/s11856-019-1897-z.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Published | Journal Article | IST-REx-ID: 9585 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.” Transactions of the American Mathematical Society, vol. 372, no. 8, American Mathematical Society, 2019, pp. 5571–94, doi:10.1090/tran/7729.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[12]
2019 | Published | Journal Article | IST-REx-ID: 9586 | OA
Kwan, Matthew Alan, et al. “Anticoncentration for Subgraph Statistics.” Journal of the London Mathematical Society, vol. 99, no. 3, Wiley, 2019, pp. 757–77, doi:10.1112/jlms.12192.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 9565 | OA
Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.” Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 592–603, doi:10.1002/rsa.20815.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Published | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich, Michael, et al. “The Random K‐matching‐free Process.” Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:10.1002/rsa.20814.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Published | Journal Article | IST-REx-ID: 9568 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” Random Structures and Algorithms, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:10.1002/rsa.20742.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 9587 | OA
Kwan, Matthew Alan, et al. “Non-Trivially Intersecting Multi-Part Families.” Journal of Combinatorial Theory Series A, vol. 156, Elsevier, 2018, pp. 44–60, doi:10.1016/j.jcta.2017.12.001.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Published | Journal Article | IST-REx-ID: 9574 | OA
Bandeira, Afonso S., et al. “Resilience for the Littlewood-Offord Problem.” Electronic Notes in Discrete Mathematics, vol. 61, Elsevier, 2017, pp. 93–99, doi:10.1016/j.endm.2017.06.025.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Published | Journal Article | IST-REx-ID: 9588 | OA
Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.” Advances in Mathematics, vol. 319, Elsevier, 2017, pp. 292–312, doi:10.1016/j.aim.2017.08.031.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Published | Journal Article | IST-REx-ID: 9589 | OA
Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” European Journal of Combinatorics, vol. 63, Elsevier, 2017, pp. 6–25, doi:10.1016/j.ejc.2017.02.003.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[4]
2017 | Published | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” SIAM Journal on Discrete Mathematics, vol. 31, no. 1, Society for Industrial & Applied Mathematics, 2017, pp. 155–71, doi:10.1137/15m1032910.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2016 | Published | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Combinatorics, Probability and Computing, vol. 25, no. 6, Cambridge University Press, 2016, pp. 909–27, doi:10.1017/s0963548316000079.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Published | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Electronic Notes in Discrete Mathematics, vol. 49, Elsevier, 2015, pp. 181–87, doi:10.1016/j.endm.2015.06.027.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Published | Journal Article | IST-REx-ID: 9594 | OA
Greenhill, Catherine, et al. “On the Number of Spanning Trees in Random Regular Graphs.” The Electronic Journal of Combinatorics, vol. 21, no. 1, P1.45, The Electronic Journal of Combinatorics, 2014, doi:10.37236/3752.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


39 Publications

Mark all

[39]
2025 | Published | Journal Article | IST-REx-ID: 19433 | OA
Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” Forum of Mathematics, Sigma, vol. 13, e55, Cambridge University Press, 2025, doi:10.1017/fms.2024.144.
[Published Version] View | Files available | DOI | arXiv
 
[38]
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
Brunck, Florestan R., and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer, vol. 47, Springer Nature, 2025, pp. 52–65, doi:10.1007/s00283-024-10358-x.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[37]
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
Glasgow, Margalit, et al. “A Central Limit Theorem for the Matching Number of a Sparse Random Graph.” Journal of the London Mathematical Society, vol. 111, no. 4, e70101, Wiley, 2025, doi:10.1112/jlms.70101.
[Published Version] View | Files available | DOI | arXiv
 
[36]
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
[Published Version] View | Files available | DOI | arXiv
 
[35]
2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
Kwan, Matthew Alan, et al. “High-Girth Steiner Triple Systems.” Annals of Mathematics, vol. 200, no. 3, Princeton University, 2024, pp. 1059–156, doi:10.4007/annals.2024.200.3.4.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[34]
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, doi:10.1007/978-3-031-78011-0_14.
[Preprint] View | DOI | Download Preprint (ext.)
 
[33]
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, Michael, et al. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society, vol. 110, no. 6, e70010, Wiley, 2024, doi:10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 
[32]
2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” Bulletin of the London Mathematical Society, vol. 56, no. 10, London Mathematical Society, 2024, pp. 3196–208, doi:10.1112/blms.13127.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2024 | Published | Journal Article | IST-REx-ID: 17475 | OA
Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.” Quarterly Journal of Mathematics, vol. 75, no. 3, Oxford University Press, 2024, pp. 869–99, doi:10.1093/qmath/haae030.
[Published Version] View | Files available | DOI | arXiv
 
[30]
2023 | Published | Journal Article | IST-REx-ID: 14444 | OA
Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[29]
2023 | Published | Journal Article | IST-REx-ID: 15173 | OA
Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique, vol. 361, no. G2, Academie des Sciences, 2023, pp. 565–75, doi:10.5802/crmath.423.
[Published Version] View | Files available | DOI | arXiv
 
[28]
2023 | Published | Journal Article | IST-REx-ID: 14499 | OA
Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.
[Published Version] View | Files available | DOI | arXiv
 
[27]
2022 | Published | Journal Article | IST-REx-ID: 11186 | OA
Kwan, Matthew Alan, et al. “Large Deviations in Random Latin Squares.” Bulletin of the London Mathematical Society, vol. 54, no. 4, Wiley, 2022, pp. 1420–38, doi:10.1112/blms.12638.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[26]
2022 | Published | Journal Article | IST-REx-ID: 11443 | OA
Kwan, Matthew Alan, et al. “Extension Complexity of Low-Dimensional Polytopes.” Transactions of the American Mathematical Society, vol. 375, no. 6, American Mathematical Society, 2022, pp. 4209–50, doi:10.1090/tran/8614.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[25]
2022 | Published | Journal Article | IST-REx-ID: 17077 | OA
Ferber, Asaf, et al. “Friendly Bisections of Random Graphs.” Communications of the American Mathematical Society, vol. 2, no. 10, American Mathematical Society, 2022, pp. 380–416, doi:10.1090/cams/13.
[Published Version] View | Files available | DOI | arXiv
 
[24]
2022 | Published | Conference Paper | IST-REx-ID: 11145 | OA
Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.” 62nd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022, IEEE, 2022, pp. 720–26, doi:10.1109/FOCS52979.2021.00075.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Published | Journal Article | IST-REx-ID: 10775 | OA
Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.” IEEE Transactions on Information Theory, vol. 68, no. 6, IEEE, 2022, pp. 3823–28, doi:10.1109/TIT.2022.3148779.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9572 | OA
Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” Bulletin of the London Mathematical Society, vol. 53, no. 2, Wiley, 2021, pp. 619–30, doi:10.1112/blms.12446.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Published | Journal Article | IST-REx-ID: 9573 | OA
He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Published | Journal Article | IST-REx-ID: 9576 | OA
Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Journal Article | IST-REx-ID: 9577 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[18]
2020 | Published | Journal Article | IST-REx-ID: 9578 | OA
Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 9581 | OA
Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9582 | OA
Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Published | Journal Article | IST-REx-ID: 9583 | OA
Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 9580 | OA
Conlon, David, et al. “Hypergraph Cuts above the Average.” Israel Journal of Mathematics, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:10.1007/s11856-019-1897-z.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Published | Journal Article | IST-REx-ID: 9585 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.” Transactions of the American Mathematical Society, vol. 372, no. 8, American Mathematical Society, 2019, pp. 5571–94, doi:10.1090/tran/7729.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[12]
2019 | Published | Journal Article | IST-REx-ID: 9586 | OA
Kwan, Matthew Alan, et al. “Anticoncentration for Subgraph Statistics.” Journal of the London Mathematical Society, vol. 99, no. 3, Wiley, 2019, pp. 757–77, doi:10.1112/jlms.12192.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[11]
2018 | Published | Journal Article | IST-REx-ID: 9565 | OA
Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.” Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 592–603, doi:10.1002/rsa.20815.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Published | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich, Michael, et al. “The Random K‐matching‐free Process.” Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:10.1002/rsa.20814.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Published | Journal Article | IST-REx-ID: 9568 | OA
Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” Random Structures and Algorithms, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:10.1002/rsa.20742.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 9587 | OA
Kwan, Matthew Alan, et al. “Non-Trivially Intersecting Multi-Part Families.” Journal of Combinatorial Theory Series A, vol. 156, Elsevier, 2018, pp. 44–60, doi:10.1016/j.jcta.2017.12.001.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Published | Journal Article | IST-REx-ID: 9574 | OA
Bandeira, Afonso S., et al. “Resilience for the Littlewood-Offord Problem.” Electronic Notes in Discrete Mathematics, vol. 61, Elsevier, 2017, pp. 93–99, doi:10.1016/j.endm.2017.06.025.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Published | Journal Article | IST-REx-ID: 9588 | OA
Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.” Advances in Mathematics, vol. 319, Elsevier, 2017, pp. 292–312, doi:10.1016/j.aim.2017.08.031.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Published | Journal Article | IST-REx-ID: 9589 | OA
Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” European Journal of Combinatorics, vol. 63, Elsevier, 2017, pp. 6–25, doi:10.1016/j.ejc.2017.02.003.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[4]
2017 | Published | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” SIAM Journal on Discrete Mathematics, vol. 31, no. 1, Society for Industrial & Applied Mathematics, 2017, pp. 155–71, doi:10.1137/15m1032910.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2016 | Published | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Combinatorics, Probability and Computing, vol. 25, no. 6, Cambridge University Press, 2016, pp. 909–27, doi:10.1017/s0963548316000079.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Published | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Electronic Notes in Discrete Mathematics, vol. 49, Elsevier, 2015, pp. 181–87, doi:10.1016/j.endm.2015.06.027.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Published | Journal Article | IST-REx-ID: 9594 | OA
Greenhill, Catherine, et al. “On the Number of Spanning Trees in Random Regular Graphs.” The Electronic Journal of Combinatorics, vol. 21, no. 1, P1.45, The Electronic Journal of Combinatorics, 2014, doi:10.37236/3752.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed