Corsten, Jan

Number of items: 10.
LSE Health
  • Corsten, Jan, Tran, Tuan (2021). Balanced supersaturation for some degenerate hypergraphs. Journal of Graph Theory, 97(4), 600-623. https://doi.org/10.1002/jgt.22674
    • Mathematics
  • Corsten, Jan, DeBiasio, Louis, McKenney, Paul (2025). Density of monochromatic infinite subgraphs II. Forum of Mathematics, Sigma, 13, https://doi.org/10.1017/fms.2025.42 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby, Skokan, Jozef (2024). A robust Corrádi–Hajnal theorem. Random Structures and Algorithms, 65(1), 61-130. https://doi.org/10.1002/rsa.21209 picture_as_pdf
  • Corsten, Jan, Tran, Tuan (2021). Balanced supersaturation for some degenerate hypergraphs. Journal of Graph Theory, 97(4), 600-623. https://doi.org/10.1002/jgt.22674
  • Corsten, Jan, Mond, Adva, Pokrovskiy, Alexey, Spiegel, Christoph, Szabó, Tibor (2020). On the odd cycle game and connected rules. European Journal of Combinatorics, 89, https://doi.org/10.1016/j.ejc.2020.103140 picture_as_pdf
  • Corsten, Jan (2020). Extremal graph colouring and tiling problems [Doctoral thesis]. London School of Economics and Political Science.
  • Bustamante, Sebastián, Corsten, Jan, Frankl, Nóra (2020). Partitioning infinite hypergraphs into few monochromatic Berge-paths. Graphs and Combinatorics, 36(3), 437 - 444. https://doi.org/10.1007/s00373-019-02113-3 picture_as_pdf
  • Bustamante, Sebastián, Corsten, Jan, Frankl, Nora, Pokrovskiy, Alexey, Skokan, Jozef (2020). Partitioning edge-colored hypergraphs into few monochromatic tight cycles. SIAM Journal on Discrete Mathematics, 34(2), 1460 – 1471. https://doi.org/10.1137/19M1269786 picture_as_pdf
  • Corsten, Jan, DeBiasio, Louis, Lamaison, Ander, Lang, Richard (2019). Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019(4). https://doi.org/10.19086/aic.10810 picture_as_pdf
  • Botler, F., Corsten, J., Dankovics, A., Frankl, N., Hàn, H., Jiménez, A., Skokan, J. (2019). Maximum number of triangle-free edge colourings with five and six colours. Acta Mathematica Universitatis Comenianae, 88(3), 495-499. picture_as_pdf
  • Corsten, Jan, Frankl, Nóra (2018). A note on diameter-Ramsey sets. European Journal of Combinatorics, 71, 51-54. https://doi.org/10.1016/j.ejc.2018.02.036