LSE creators

Number of items: 55.
LSE
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef (2017). Report of the large-scale Structures in random graphs workshop.
    • Mathematics
  • Skokan, Jozef, Tyomkyn, Mykhaylo (2025). Alternating paths in oriented graphs with large semidegree. Electronic Journal of Combinatorics, 32(4). https://doi.org/10.37236/13084 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Lang, Richard, Skokan, Jozef, Stein, Maya (2024). Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. European Journal of Combinatorics, 121, https://doi.org/10.1016/j.ejc.2023.103838 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2024). The square of a Hamilton cycle in randomly perturbed graphs. Random Structures and Algorithms, 65(2), 342 - 386. https://doi.org/10.1002/rsa.21215 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
  • Liu, Hong, Shangguan, Chong, Skokan, Jozef, Xu, Zixiang (2024). Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon. In Mulzer, Wolfgang, Phillips, Jeff M. (Eds.), 40th International Symposium on Computational Geometry (SoCG 2024) . Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.71 picture_as_pdf
  • Allen, Peter, Mergoni Cecchelli, Domenico, Skokan, Jozef, Roberts, Barnaby (2024). The Ramsey numbers of squares of paths and cycles. Electronic Journal of Combinatorics, 31(2). https://doi.org/10.37236/11847 picture_as_pdf
  • Bonamy, Marthe, Botler, Fábio, Dross, François, Naia, Tássio, Skokan, Jozef (2023). Separating the edges of a graph by a linear number of paths. Advances in Combinatorics, https://doi.org/10.19086/aic.2023.6 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2023). Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing, 32(1), 91 - 121. https://doi.org/10.1017/S0963548322000153 picture_as_pdf
  • Liebenau, Anita, Mattos, Letícia, Mendonça, Walner, Skokan, Jozef (2022). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms, https://doi.org/10.1002/rsa.21106 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2022). Cycle factors in randomly perturbed graphs. Procedia Computer Science, 195, 404 - 411. https://doi.org/10.1016/j.procs.2021.11.049 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hng, Eng Keat, Skokan, Jozef, Davies, Ewan (2022). An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195, 394 - 403. https://doi.org/10.1016/j.procs.2021.11.048 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2021). The square of a Hamilton cycle in randomly perturbed graphs. In Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo, Serra, Oriol (Eds.), Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications (pp. 644 - 650). Birkhäuser (Firm). https://doi.org/10.1007/978-3-030-83823-2_103 picture_as_pdf
  • Jenssen, Matthew, Skokan, Jozef (2021). Exact Ramsey numbers of odd cycles via nonlinear optimisation. Advances in Mathematics, 376, https://doi.org/10.1016/j.aim.2020.107444 picture_as_pdf
  • Keevash, Peter, Long, Eoin, Skokan, Jozef (2021). Cycle-complete ramsey numbers. International Mathematics Research Notices, 2021(1), 275 – 300. https://doi.org/10.1093/imrn/rnz119 picture_as_pdf
  • Lo, Allan, Patel, Viresh, Skokan, Jozef, Talbot, John (2020). Decomposing tournaments into paths. Proceedings of the London Mathematical Society, 121(2), 426 - 461. https://doi.org/10.1112/plms.12328 picture_as_pdf
  • Balogh, József, Clemen, Felix Cristian, Skokan, Jozef, Wgner, Adam Zsolt (2020). The Ramsey number of Fano plane versus tight path. Electronic Journal of Combinatorics, 27(1). https://doi.org/10.37236/8374 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef, Stein, Maya (2020). Regularity inheritance in pseudorandom graphs. Random Structures and Algorithms, 56(2), 306 - 338. https://doi.org/10.1002/rsa.20851 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
  • Liebenau, A., Mattos, L., Mendonça, W., Skokan, J. (2019). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Acta Mathematica Universitatis Comenianae, 88(3), 917 - 922. 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
  • Balogh, József, Narayanan, Bhargav, Skokan, Jozef (2019). The number of hypergraphs without linear cycles. Journal of Combinatorial Theory, Series B, 134, 309-321. https://doi.org/10.1016/j.jctb.2018.07.003
  • Martin, Ryan R., Skokan, Jozef (2017). Asymptotic multipartite version of the Alon–Yuster theorem. Journal of Combinatorial Theory, Series B, 127, 32-52. https://doi.org/10.1016/j.jctb.2017.05.004
  • Balogh, József, Mousset, Frank, Skokan, Jozef (2017). Stability for vertex cycle covers. Electronic Journal of Combinatorics, 24(3).
  • Lo, Allan, Patel, Viresh, Skokan, Jozef, Talbot, John (2017). Decomposing tournaments into paths. Electronic Notes in Discrete Mathematics, 61, 813-818. https://doi.org/10.1016/j.endm.2017.07.040
  • Martin, Ryan R., Mycroft, Richard, Skokan, Jozef (2017). An asymptotic multipartite Kühn-Osthus theorem. SIAM Journal on Discrete Mathematics, 31(3), 1498-1513. https://doi.org/10.1137/16M1070621
  • Pontiveros, Gonzalo Fiz, Griffiths, Simon, Morris, Robert, Saxton, David, Skokan, Jozef (2016). On the Ramsey number of the triangle and the cube. Combinatorica, 36(1), 71-89. https://doi.org/10.1007/s00493-015-3089-8
  • Allen, Peter, Roberts, Barnaby, Skokan, Jozef (2015-08-31 - 2015-09-04) Ramsey numbers of squares of paths [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Skokan, Jozef, Stein, M. (2014). Cycles are strongly Ramsey-unsaturated. Combinatorics, Probability and Computing, 23(04), 607-630. https://doi.org/10.1017/S0963548314000212
  • Fiz Pontiveros, Gonzalo, Griffiths, Simon, Morris, Robert, Saxton, David, Skokan, Jozef (2014). The Ramsey number of the clique and the hypercube. Journal of the London Mathematical Society, 89(3), 680 - 702. https://doi.org/10.1112/jlms/jdu004
  • Allen, Peter, Brightwell, Graham, Skokan, Jozef (2013). Ramsey-goodness - and otherwise. Combinatorica, 33(2), 125-160. https://doi.org/10.1007/s00493-013-2778-4
  • Allen, Peter, Skokan, Jozef, Würfl, Andreas (2013). Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 20(3). https://doi.org/P1
  • Benevides, F. S., Łuczak, T., Scott, A., Skokan, Jozef, White, M. (2012). Monochromatic cycles in 2-coloured graphs. Combinatorics, Probability and Computing, 21(1-2), 57-87. https://doi.org/10.1017/S0963548312000090
  • Łuczak, Tomasz, Simonovits, Miklós, Skokan, Jozef (2011). On the multi-colored Ramsey numbers of cycles. Journal of Graph Theory, 69(2), 169-175. https://doi.org/10.1002/jgt.20572
  • Allen, Peter, Brightwell, Graham, Skokan, Jozef (2010). Ramsey-goodness - and otherwise. arXiv.org.
  • Kohayakawa, Yoshiharu, Rödl, Vojtech, Schacht, Mathias, Skokan, Jozef (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In Barany, Imre, Solymosi, József, Sagi, Gabor (Eds.), An Irregular Mind: Szemerédi Is 70 (pp. 359-404). Springer Berlin / Heidelberg.
  • Benevides, Fabricio Siqueira, Skokan, Jozef (2009). The 3-colored Ramsey number of even cycles. Journal of Combinatorial Theory, Series B, 99(4), 690-708. https://doi.org/10.1016/j.jctb.2008.12.002
  • Marciniszyn, Martin, Skokan, Jozef, Spöhel, Reto, Steger, Angelika (2009). Asymmetric Ramsey properties of random graphs involving cliques. Random Structures and Algorithms, 34(4), 419-453. https://doi.org/10.1002/rsa.20239
  • Haxell, Penny, Łucak, T, Peng, Y, Rodl, V, Rucinski, Andrzej, Skokan, Jozef (2009). The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability and Computing, 18(1-2), 165-203. https://doi.org/10.1017/S096354830800967X
  • Eaton, Nancy, Furedi, Z, Kostochka, Alexandr V, Skokan, Jozef (2007). Three representations of graphs. European Journal of Combinatorics, 28(4), 1087-1098. https://doi.org/10.1016/j.ejc.2006.04.002
  • Kohayakawa, Yoshiharu, Rödl, Vojtech, Schacht, Mathias, Sissokho, Papa, Skokan, Jozef (2007). Turán's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Series A, 114(4), 631-657. https://doi.org/10.1016/j.jcta.2006.08.004
  • Marciniszyn, M, Skokan, Jozef, Spohel, R, Stegar, A (2007). Asymmetric Ramsey properties of random graphs involving cliques. London School of Economics and Political Science.
  • Haxell, Penny, Luczak, Tomasz, Peng, Yuejian, Rodl, V, Rucinski, Andrzej, Skokan, Jozef (2007). The Ramsey number for hypergraph cycles II. London School of Economics and Political Science.
  • Kim, Seog-Jin, Nakprasit, Kittikorn, Pelsmajer, Michael, Skokan, Jozef (2006). Transversal numbers of translates of a convex body. Discrete Mathematics, 306(18), 2166-2173. https://doi.org/10.1016/j.disc.2006.05.014
  • Marciniszyn, Martin, Skokan, Jozef, Spöhel, Reto, Steger, Angelika (2006). Threshold functions for asymmetric Ramsey properties involving cliques. In Diaz, Josep, Jansen, Klaus, Rolim, José D P, Zwick, Uri (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 462-474). Springer Berlin / Heidelberg. https://doi.org/10.1007/11830924_42
  • Rödl, Vojtech, Skokan, Jozef (2006). Applications of the regularity lemma for uniform hypergraphs. Random Structures and Algorithms, 28(2), 180-194. https://doi.org/10.1002/rsa.20108
  • Haxell, Penny, Luczak, Tomasz, Peng, Yuejian, Rödl, Vojtech, Rucinski, Andrzej, Simonovits, Miklós, Skokan, Jozef (2006). The Ramsey number for hypergraph cycles I. Journal of Combinatorial Theory, Series A, 113(1), 67-83. https://doi.org/10.1016/j.jcta.2005.02.005
  • Rödl, Vojtech, Nagle, Brendan, Skokan, Jozef, Schacht, Mathias, Kohayakawa, Yoshiharu (2005). The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, 102(23), 8109-8113. https://doi.org/10.1073/pnas.0502771102
  • Kohayakawa, Yoshiharu, Simonovits, Miklós, Skokan, Jozef (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics, 19(1), 397-402. https://doi.org/10.1016/j.endm.2005.05.053
  • Peng, Yuejian, Rödl, Vojtech, Skokan, Jozef (2005). Counting small cliques in 3-uniform hypergraphs. Combinatorics, Probability and Computing, 14(3), 371-413. https://doi.org/10.1017/S0963548304006546
  • Rödl, Vojtech, Skokan, Jozef (2005). Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Structures & Algorithms, 26(1-2), 160-203. https://doi.org/10.1002/rsa.20056
  • Rödl, Vojtech, Skokan, Jozef (2004). Regularity lemma for k-uniform hypergraphs. Random Structures & Algorithms, 25(1), 1-42. https://doi.org/10.1002/rsa.20017
  • Skokan, Jozef, Thoma, Lubos (2004). Bipartite subgraphs and quasi-randomness. Graphs and Combinatorics, 20(2), 255-262. https://doi.org/10.1007/s00373-004-0556-1
  • Kohayakawa, Yoshiharu, Rödl, Vojtech, Skokan, Jozef (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory, Series A, 97(2), 307-352. https://doi.org/10.1006/jcta.2001.3217
  • Kohayakawa, Yoshiharu, Rödl, Vojtech, Skokan, Jozef (2000). Equivalent conditions for regularity (extended abstract). In Gonnet, Gaston, Panario, Daniel, Viola, Alfredo (Eds.), Latin 2000: Theoretical Informatics (pp. 48-57). Springer Berlin / Heidelberg. https://doi.org/10.1007/10719839