|
 | Up a level |
Allen, Peter 
ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676
(2024)
A robust Corrádi–Hajnal theorem.
Random Structures and Algorithms, 65 (1).
pp. 61-130.
ISSN 1042-9832
Corsten, Jan and Tran, Tuan (2021) Balanced supersaturation for some degenerate hypergraphs. Journal of Graph Theory, 97 (4). pp. 600-623. ISSN 0364-9024
Corsten, Jan, Mond, Adva, Pokrovskiy, Alexey, Spiegel, Christoph and Szabó, Tibor (2020) On the odd cycle game and connected rules. European Journal of Combinatorics, 89. ISSN 0195-6698
Bustamante, Sebastián, Corsten, Jan and Frankl, Nóra (2020) Partitioning infinite hypergraphs into few monochromatic Berge-paths. Graphs and Combinatorics, 36 (3). 437 - 444. ISSN 0911-0119
Bustamante, Sebastián, Corsten, Jan, Frankl, Nora, Pokrovskiy, Alexey and Skokan, Jozef ORCID: 0000-0003-3996-7676
(2020)
Partitioning edge-colored hypergraphs into few monochromatic tight cycles.
SIAM Journal on Discrete Mathematics, 34 (2).
1460 – 1471.
ISSN 0895-4801
Corsten, Jan, DeBiasio, Louis, Lamaison, Ander and Lang, Richard (2020) Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019 (4). ISSN 2517-5599
Corsten, Jan and Frankl, Nóra (2018) A note on diameter-Ramsey sets. European Journal of Combinatorics, 71. pp. 51-54. ISSN 0195-6698
