The Library
Browse by Warwick Author
Up a level |
Jump to: Bayerisches Hochschulzentrum für Mittel-, Ost- und Südosteuropa (BAYHOST) | Deutsche Forschungsgemeinschaft (DFG) | Deutscher Akademischer Austauschdienst (DAAD) | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | European Research Council (ERC) | Grantová agentura České republiky [Czech Science Foundation] (AVČR) | Hungary. Nemzeti Kutatási Fejlesztés És Innovációs Hivatal [National Research, Development and Innovation Office] (NKFIH) | KONTAKT ME (KM) | King Fahd University of Petroleum and Minerals | Leverhulme Trust (LT) | Leverhulme Trust (LT). Early Career Fellowship | Marie Skłodowska-Curie Actions | Ministry of Education of the Czech Republic | National Science Foundation (U.S.) (NSF) | Natural Sciences and Engineering Research Council of Canada (NSERC) | Rijksdienst voor Ondernemend (RVO) | Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFBR) | Seventh Framework Programme (European Commission) (FP7) | Technische Universität München (TUM) | Toyota Kōgyō Daigaku [Toyota Technological Institute] | Univerzita Karlova | Univerzita Karlova (UK)
Number of items: 29.
Bayerisches Hochschulzentrum für Mittel-, Ost- und Südosteuropa (BAYHOST)
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
Deutsche Forschungsgemeinschaft (DFG)
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
Deutscher Akademischer Austauschdienst (DAAD)
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
Engineering and Physical Sciences Research Council (EPSRC)
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei and Razborov, Alexander (2013) On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A, Volume 120 (Number 3). pp. 722-732. doi:10.1016/j.jcta.2012.12.008 ISSN 0097-3165.
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
European Research Council (ERC)
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei and Razborov, Alexander (2013) On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A, Volume 120 (Number 3). pp. 722-732. doi:10.1016/j.jcta.2012.12.008 ISSN 0097-3165.
European Research Council (ERC)
Dolezal, Martin, Hladký, Jan, Hu, Ping and Piguet, Diana (2017) First steps in combinatorial optimization on graphons : matchings. Electronic Notes in Discrete Mathematics, 61 . pp. 359-365. doi:10.1016/j.endm.2017.06.060 ISSN 1571-0653.
Grantová agentura České republiky [Czech Science Foundation] (AVČR)
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
Hungary. Nemzeti Kutatási Fejlesztés És Innovációs Hivatal [National Research, Development and Innovation Office] (NKFIH)
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
KONTAKT ME (KM)
Hladký, Jan, Králʼ, Daniel and Norine, Serguei (2013) Rank of divisors on tropical curves. Journal of Combinatorial Theory, Series A, Volume 120 (Number 7). pp. 1521-1538. doi:10.1016/j.jcta.2013.05.002 ISSN 0097-3165.
King Fahd University of Petroleum and Minerals
Hladký, Jan, Kral', Daniel and Schauz, Uwe (2010) Brooks' theorem via the Alon-Tarsi theorem. Discrete Mathematics, Vol.310 (No.23). pp. 3426-3428. doi:10.1016/j.disc.2010.07.019 ISSN 0012-365X.
Leverhulme Trust (LT)
Dolezal, Martin, Hladký, Jan, Hu, Ping and Piguet, Diana (2017) First steps in combinatorial optimization on graphons : matchings. Electronic Notes in Discrete Mathematics, 61 . pp. 359-365. doi:10.1016/j.endm.2017.06.060 ISSN 1571-0653.
Leverhulme Trust (LT). Early Career Fellowship
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
Marie Skłodowska-Curie Actions
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
Ministry of Education of the Czech Republic
Hladký, Jan, Kral', Daniel and Schauz, Uwe (2010) Brooks' theorem via the Alon-Tarsi theorem. Discrete Mathematics, Vol.310 (No.23). pp. 3426-3428. doi:10.1016/j.disc.2010.07.019 ISSN 0012-365X.
National Science Foundation (U.S.) (NSF)
Hladký, Jan, Králʼ, Daniel and Norine, Serguei (2016) Counting flags in triangle-free digraphs. Combinatorica, 37 (1). pp. 49-76. doi:10.1007/s00493-015-2662-5 ISSN 0209-9683.
Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0 ISSN 0002-9947.
Hladký, Jan, Králʼ, Daniel and Norine, Serguei (2013) Rank of divisors on tropical curves. Journal of Combinatorial Theory, Series A, Volume 120 (Number 7). pp. 1521-1538. doi:10.1016/j.jcta.2013.05.002 ISSN 0097-3165.
Natural Sciences and Engineering Research Council of Canada (NSERC)
Hladký, Jan, Králʼ, Daniel and Norine, Serguei (2016) Counting flags in triangle-free digraphs. Combinatorica, 37 (1). pp. 49-76. doi:10.1007/s00493-015-2662-5 ISSN 0209-9683.
Rijksdienst voor Ondernemend (RVO)
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
Rossiĭskiĭ fond fundamentalʹnykh issledovaniĭ [Russian Foundation for Basic Research] (RFBR)
Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei and Razborov, Alexander (2013) On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A, Volume 120 (Number 3). pp. 722-732. doi:10.1016/j.jcta.2012.12.008 ISSN 0097-3165.
Seventh Framework Programme (European Commission) (FP7)
Dolezal, M., Hladký, Jan and Máthé, András (2017) Cliques in dense in homogeneous random graphs. Random Structures & Algorithms, 51 (2). pp. 275-314. doi:10.1002/rsa.20715 ISSN 1042-9832.
Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei and Razborov, Alexander (2013) On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A, Volume 120 (Number 3). pp. 722-732. doi:10.1016/j.jcta.2012.12.008 ISSN 0097-3165.
Technische Universität München (TUM)
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
Toyota Kōgyō Daigaku [Toyota Technological Institute]
Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei and Razborov, Alexander (2013) On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A, Volume 120 (Number 3). pp. 722-732. doi:10.1016/j.jcta.2012.12.008 ISSN 0097-3165.
Univerzita Karlova
Hladký, Jan, Králʼ, Daniel and Norine, Serguei (2016) Counting flags in triangle-free digraphs. Combinatorica, 37 (1). pp. 49-76. doi:10.1007/s00493-015-2662-5 ISSN 0209-9683.
Univerzita Karlova (UK)
Allen, Peter D., Böttcher, Julia and Hladký, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, Vol.84 (No.2). pp. 269-302. doi:10.1112/jlms/jdr007 ISSN 0024-6107.
This list was generated on Thu Apr 18 22:04:12 2024 BST.