Jozef Skokan
Possui mestrado em Applied Mathematics (Mathematical Engineering) - Czech Technical University (1995) e doutorado em Discrete Mathematics - Emory University (2000). Atualmente é professor - London School of Economics and Political Science. Tem experiência na área de Matemática, com ênfase em Matemática Discreta e Combinatória
Informações coletadas do Lattes em 04/11/2022
Acadêmico
Formação acadêmica
Doutorado em Discrete Mathematics
1995 - 2000
Emory University
Título: Uniformity of set systems
Orientador: Vojtech Rodl
Mestrado em Applied Mathematics (Mathematical Engineering)
1990 - 1995
Czech Technical University
Título: Modeling of ground water flow in porous media, Ano de Obtenção: 1995
Orientador: Jiri Maryska
Grande área: Ciências Exatas e da TerraGrande Área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Matemática Aplicada / Especialidade: Análise Numérica.
Pós-doutorado
2005 - 2006
Pós-Doutorado. , Universidade de São Paulo, USP, Brasil. , Bolsista do(a): Fundação de Amparo à Pesquisa do Estado de São Paulo, FAPESP, Brasil. , Grande área: Ciências Exatas e da Terra
2003 - 2005
Pós-Doutorado. , Universidade de São Paulo, USP, Brasil. , Bolsista do(a): National Science Foundation, NSF, Estados Unidos.
2000 - 2003
Pós-Doutorado. , University of Illinois at Urbana-Champaign, UIUC, Estados Unidos. , Grande área: Ciências Exatas e da Terra
Idiomas
Inglês
Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Português
Compreende Razoavelmente, Fala Pouco, Lê Razoavelmente, Escreve Razoavelmente.
Russo
Compreende Razoavelmente, Fala Razoavelmente, Lê Razoavelmente, Escreve Razoavelmente.
Eslovaco
Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Áreas de atuação
Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Matemática Aplicada/Especialidade: Matemática Discreta e Combinatória.
Orientou
Extremal Problems in Graph Theory and a Hypergraph Packing Problem; 2022; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Coorientador: Jozef Skokan;
On some problems in combinatorial geometry; 2020; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Coorientador: Jozef Skokan;
Jenssen; Continuous optimisation in extremal combinatorics; 2017; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Orientador: Jozef Skokan;
Structure and randomness in external combinatorics; 2017; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Coorientador: Jozef Skokan;
Extremal and Probabilistic results for regular graphs; 2017; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Orientador: Jozef Skokan;
Graph powers, partitioning and other extremal problems; 2013; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Coorientador: Jozef Skokan;
Topics in Graph Colouring and Graph Structures; 2013; Tese (Doutorado em PhD in Mathematics) - London School of Economics and Political Science,; Coorientador: Jozef Skokan;
Produções bibliográficas
-
JENSSEN, MATTHEW ; Skokan, Jozef . Exact Ramsey numbers of odd cycles via nonlinear optimisation. ADVANCES IN MATHEMATICS , v. 376, p. 107444, 2021.
-
ALLEN, PETER ; BÖTTCHER, JULIA ; HNG, ENG KEAT ; Skokan, Jozef ; DAVIES, EWAN . An Approximate Blow-up Lemma for Sparse Hypergraphs. PROCEDIA COMPUTER SCIENCE , v. 195, p. 394-403, 2021.
-
BÖTTCHER, JULIA ; Parczyk, Olaf ; Sgueglia, Amedeo ; Skokan, Jozef . Cycle factors in randomly perturbed graphs. PROCEDIA COMPUTER SCIENCE , v. 195, p. 404-411, 2021.
-
ALLEN, PETER ; BÖTTCHER, JULIA ; Skokan, Jozef ; STEIN, MAYA . Regularity inheritance in pseudorandom graphs. RANDOM STRUCTURES & ALGORITHMS , v. 56, p. 306-338, 2020.
-
LO, ALLAN ; PATEL, VIRESH ; Skokan, Jozef ; TALBOT, JOHN . Decomposing tournaments into paths. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY , v. 121, p. 426-461, 2020.
-
BALOGH, JÓZSEF ; CLEMEN, FELIX CHRISTIAN ; Skokan, Jozef ; WAGNER, ADAM ZSOLT . The Ramsey Number of Fano Plane Versus Tight Path. ELECTRONIC JOURNAL OF COMBINATORICS , v. 27, p. P1.60, 2020.
-
BUSTAMANTE, SEBASTIÁN ; CORSTEN, JAN ; FRANKL, NÓRA ; POKROVSKIY, ALEXEY ; Skokan, Jozef . Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles. SIAM JOURNAL ON DISCRETE MATHEMATICS , v. 34, p. 1460-1471, 2020.
-
KEEVASH, PETER ; LONG, EOIN ; Skokan, Jozef . Cycle-Complete Ramsey Numbers. INTERNATIONAL MATHEMATICS RESEARCH NOTICES , v. 2021, p. 275-300, 2020.
-
BALOGH, JÓZSEF ; NARAYANAN, BHARGAV ; Skokan, Jozef . The number of hypergraphs without linear cycles. JOURNAL OF COMBINATORIAL THEORY SERIES B , v. 134, p. 309-321, 2018.
-
MARTIN, RYAN R. ; MYCROFT, RICHARD ; Skokan, Jozef . An Asymptotic Multipartite Kühn--Osthus Theorem. SIAM JOURNAL ON DISCRETE MATHEMATICS , v. 31, p. 1498-1513, 2017.
-
MARTIN, RYAN R. ; Skokan, Jozef . Asymptotic multipartite version of the Alon-Yuster theorem. JOURNAL OF COMBINATORIAL THEORY SERIES B , p. 32-52, 2017.
-
BALOGH, J. ; MOUSSET, F. ; SKOKAN, J. . Stability for Vertex Cycle Covers. ELECTRONIC JOURNAL OF COMBINATORICS , v. 24, p. P3.56, 2017.
-
GRIFFITHS, S. ; MORRIS, R. ; PONTIVEROS, G. F. ; SAXTON, D. ; SKOKAN, J. . On the Ramsey number of the triangle and the cube. Combinatorica (Budapest. Print) , v. 36, p. 71-89, 2016.
-
ALLEN, PETER ; ROBERTS, BARNABY ; Skokan, Jozef . Ramsey Numbers of Squares of Paths. Electronic Notes in Discrete Mathematics , v. 49, p. 637-641, 2015.
-
SKOKAN, J. ; STEIN, M. . Cycles Are Strongly Ramsey-Unsaturated. Combinatorics, Probability & Computing (Print) , v. 23, p. 607-630, 2014.
-
GRIFFITHS, S. ; MORRIS, R. ; PONTIVEROS, G. F. ; SAXTON, D. ; SKOKAN, J. . The Ramsey number of the clique and the hypercube. Journal of the London Mathematical Society (Print) , p. 680-702, 2014.
-
ALLEN, P. ; BRIGHTWELL, G. ; SKOKAN, J. . Ramsey-goodnessand otherwise. Combinatorica , v. 33, p. 125-160, 2013.
-
ALLEN, P. ; SKOKAN, J. ; WUERFL, A. . Maximum Planar Subgraphs in Dense Graphs. ELECTRONIC JOURNAL OF COMBINATORICS , v. 20, p. P1, 2013.
-
LUCZAK, T. ; SIMONOVITS, M. ; SKOKAN, J. . On the multi-colored Ramsey numbers of cycles. Journal of Graph Theory (Print) , v. 69, p. 169-175, 2012.
-
BENEVIDES, F. ; LUCZAK, T. ; SCOTT, A. ; SKOKAN, J. ; WHITE, M. . Monochromatic Cycles in 2-Coloured Graphs. Combinatorics, Probability & Computing (Print) , v. 21, p. 57-87, 2012.
-
HAXELL, P. ; LUCZAK, T. ; PENG, Y. ; RÖDL, V. ; RUCINSKI, A. ; SKOKAN, J. . The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability & Computing , v. 18, p. 165-203, 2009.
-
BENEVIDES, F. ; SKOKAN, J. . The 3-colored Ramsey number of even cycles. Journal of Combinatorial Theory. Series B , v. 99, p. 690-708, 2009.
-
MARCINISZYN, M. ; SKOKAN, J. ; SPOHEL, R. ; STEGER, A. . Asymmetric Ramsey properties of random graphs involving cliques. Random Structures & Algorithms (Print) , v. 34, p. 419-453, 2009.
-
KOHAYAKAWA, Y. ; RODL, V. ; SCHACHT, M. ; SISSOKHO, P. ; SKOKAN, J. . Turán's theorem for pseudo-random graphs. Journal of Combinatorial Theory. Series A , v. 114, p. 631-657, 2007.
-
EATON, N. ; FUREDI, Z. ; KOSTOCHKA, A. ; SKOKAN, J. . Tree representations of graphs. European Journal of Combinatorics , v. 28, p. 1087-1098, 2007.
-
HAXELL, P. ; LUCZAK, T. ; PENG, Y. ; RODL, V. ; RUCINSKI, A. ; SIMONOVITS, M. ; SKOKAN, J. . The Ramsey Number for Hypergraph Cycles I. Journal of Combinatorial Theory. Series A , v. 113, p. 67-83, 2006.
-
RODL, V. ; SKOKAN, J. . Applications of the Regularity Lemma for Uniform Hypergraphs. Random Structures & Algorithms (Print) , v. 28, p. 180-194, 2006.
-
KIM, S. ; NAKPRASIT, K. ; PELSMAJER, M. J. ; SKOKAN, J. . Transversal Numbers of Translates of a Convex Body. Discrete Mathematics , v. 306, p. 2166-2173, 2006.
-
PENG, Y. ; RODL, V. ; SKOKAN, J. . Counting Small Cliques in 3-uniform Hypergraphs. Combinatorics, Probability & Computing , v. 14, n.3, p. 371-413, 2005.
-
RODL, V. ; SKOKAN, J. . Counting Subgraphs in Quasi-random 4-uniform Hypergraphs. Random Structures & Algorithms , v. 26, n.1-2, p. 160-203, 2005.
-
RODL, V. ; NAGLE, B. ; SKOKAN, J. ; SCHACHT, M. ; KOHAYAKAWA, Y. . The Hypergraph Regularity Method and Its Applications. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA , v. 102, n.23, p. 8109-8113, 2005.
-
SKOKAN, J. ; THOMA, L. . Bipartite Subgraphs and Quasi-randomness. Graphs and Combinatorics , v. 20, n.2, p. 255-262, 2004.
-
RODL, V. ; SKOKAN, J. . Regularity Lemma for Uniform Hypergraphs. Random Structures & Algorithms , v. 25, n.1, p. 1-42, 2004.
-
KOHAYAKAWA, Y. ; RODL, V. ; SKOKAN, J. . Hypergraphs, Quasi-randomness, and Conditions for Regularity. Journal of Combinatorial Theory. Series A , v. 97, p. 307-352, 2002.
-
BÖTTCHER, JULIA ; Parczyk, Olaf ; Sgueglia, Amedeo ; Skokan, Jozef . The Square of a Hamilton Cycle in Randomly Perturbed Graphs. In: Ne?etil J., Perarnau G., Rué J., Serra O.. (Org.). Trends in Mathematics. TMed.: Springer International Publishing, 2021, v. 14, p. 644-650.
-
Kohayakawa, Yoshiharu ; RÖdlt, Vojtch ; Schacht, Mathias ; Skokan, Jozef . On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs. In: Imre Bárány; Jozsef Solymosi.. (Org.). Bolyai Society Mathematical Studies. 21ed.Berlin: Springer Berlin Heidelberg, 2010, v. , p. 359-404.
-
BOTLER, F. ; CORSTEN, J. ; DANKOVICS, A. ; FRANKL, N. ; HAN, H. ; JIMENEZ, A. ; SKOKAN, J. . Maximum number of triangle-free edge colourings with five and six colours. In: Eurocomb 2019, 2019, Bratislava, Slovakia. Acta Mathematica Universitatis Comenianae, 2019. v. 88. p. 495-499.
-
LIEBENAU, A. ; MATTOS, L. ; MENDONCA, W. ; SKOKAN, J. . Asymmetric Ramsey properties of random graphs involving cliques and cycles. In: Eurocomb 2019, 2019, Bratislava, Slovakia. Acta Mathematica Universitatis Comenianae, 2019. v. 88. p. 917-922.
-
LO, ALLAN ; PATEL, VIRESH ; Skokan, Jozef ; TALBOT, JOHN . Decomposing tournaments into paths. In: Eurocomb, 2017, Vienna. Electronic Notes in Discrete Mathematics, 2017. v. 61. p. 813-818.
-
MARCINISZYN, M. ; SKOKAN, J. ; SPOHEL, R. ; STEGER, A. . Threshold functions for asymmetric Ramsey properties involving cliques. In: RANDOM 2006, 2006, Barcelona. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2006. v. 4110. p. 462-474.
-
KOHAYAKAWA, Y. ; RODL, V. ; SKOKAN, J. . Equivalent conditions for regularity. In: LATIN 2000: 4th Latin American symposium on Theoretical Informatics., 2000, Punta del Este, Uruguay. Lect. Notes Comp. Science, 2000. v. 1776. p. 48-57.
-
KOHAYAKAWA, Y. ; SIMONOVITS, M. ; SKOKAN, J. . The 3-colored Ramsey number of odd cycles. In: Second Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 2005), 2005, Angra dos Reis. Electronic Notes in Discrete Mathematics, 2005. v. 19. p. 397-402.
-
LIEBENAU, ANITA ; MATTOS, LETÍCIA ; MENDONÇA, WALNER ; Skokan, Jozef . Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms , 2022.
-
BÖTTCHER, JULIA ; Parczyk, Olaf ; Sgueglia, Amedeo ; Skokan, Jozef . Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing (Online) , 2022.
Histórico profissional
Endereço profissional
-
London School of Economics and Political Science, Department of Mathematics. , Houghton Street, Columbia House, COL.3.04, London, WC2A2AE - London, - Grã-Bretanha, Telefone: (0044) 2079557008, URL da Homepage:
Experiência profissional
2016 - Atual
London School of Economics and Political ScienceVínculo: Docente, Enquadramento Funcional: Professor, Carga horária: 40, Regime: Dedicação exclusiva.
2012 - 2016
London School of Economics and Political ScienceVínculo: Docente, Enquadramento Funcional: Professor associado, Carga horária: 40, Regime: Dedicação exclusiva.
2006 - 2012
London School of Economics and Political ScienceVínculo: Docente, Enquadramento Funcional: Professor doutor, Carga horária: 40, Regime: Dedicação exclusiva.
Criando um monitoramento
Nossos robôs irão buscar nos nossos bancos de dados todos os processos de Jozef Skokan e sempre que o nome aparecer em publicações dos Diários Oficiais, avisaremos por e-mail e pelo painel do usuário
Criando um monitoramento
Nossos robôs irão buscar nos nossos bancos de dados todas as movimentações desse processo e sempre que o processo aparecer em publicações dos Diários Oficiais e nos Tribunais, avisaremos por e-mail e pelo painel do usuário
Confirma a exclusão?