The Library
Browse by Warwick Author
Up a level |
Jump to: Deutsche Forschungsgemeinschaft (DFG) | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | Hubert Curien Program (HCP) | National Science Foundation (U.S.) (NSF) | Seventh Framework Programme (European Commission) (FP7) | Simons Foundation (SF) | Univerzita Karlova. Grantové agentury (GAUK)
Number of items: 9.
Deutsche Forschungsgemeinschaft (DFG)
Glebov, Roman, Králʼ, Daniel and Volec, Jan (2016) A problem of Erdős and Sós on 3-graphs. Israel Journal of Mathematics, 211 (1). pp. 349-366. doi:10.1007/s11856-015-1267-4 ISSN 0021-2172.
Engineering and Physical Sciences Research Council (EPSRC)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
European Research Council (ERC)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Hubert Curien Program (HCP)
van den Heuvel, Jan, Král', Daniel, Kupec, Martin, Sereni, Jean-Sébastien and Volec, Jan (2014) Extensions of fractional precolorings show discontinuous behavior. Journal of Graph Theory, Volume 77 (Number 4). pp. 299-329. doi:10.1002/jgt.21787 ISSN 0364-9024.
National Science Foundation (U.S.) (NSF)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Seventh Framework Programme (European Commission) (FP7)
Glebov, Roman, Králʼ, Daniel and Volec, Jan (2016) A problem of Erdős and Sós on 3-graphs. Israel Journal of Mathematics, 211 (1). pp. 349-366. doi:10.1007/s11856-015-1267-4 ISSN 0021-2172.
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Simons Foundation (SF)
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820 ISSN 0963-5483.
Univerzita Karlova. Grantové agentury (GAUK)
Glebov, Roman, Králʼ, Daniel and Volec, Jan (2016) A problem of Erdős and Sós on 3-graphs. Israel Journal of Mathematics, 211 (1). pp. 349-366. doi:10.1007/s11856-015-1267-4 ISSN 0021-2172.
This list was generated on Fri Mar 29 09:01:39 2024 GMT.