The Library
Browse by Warwick Author
Up a level |
Jump to: Journal Article
Number of items: 22.
Journal Article
Dolezal, Martin, Grebík, Jan, Hladký, Jan, Rocha, Israel and Rozhoň, Václav (2022) Cut distance identifying graphon parameters over weak* limits. Journal of Combinatorial Theory, Series A, 189 . 105615. doi:10.1016/j.jcta.2022.105615 ISSN 0097-3165.
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.
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.
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.
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.
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.
Allen, Peter, Böttcher, Julia, Hladký, Jan and Piguet, Diana (2013) Turánnical hypergraphs. Random Structures & Algorithms, Vol.42 (No.1). pp. 29-58. doi:10.1002/rsa.20399 ISSN 1042-9832.
Grosu, Codruţ and Hladký, Jan (2012) The extremal function for partial bipartite tilings. European Journal of Combinatorics, Vol.33 (No.5). pp. 807-815. doi:10.1016/j.ejc.2011.09.026 ISSN 01956698.
Böttcher, Julia, Hladký, Jan and Piguet, Diana (2012) The tripartite Ramsey number for trees. Journal of Graph Theory, Vol.69 (No.3). pp. 264-300. doi:10.1002/jgt.20582 ISSN 0364-9024.
Hatami, Hamed, Hladký, Jan, Kral', Daniel, Norine, Serguei and Razborov, Alexander (2012) Non-three-colourable common graphs exist. Combinatorics, Probability and Computing, Vol.21 (No.5). pp. 734-742. doi:10.1017/S0963548312000107 ISSN 0963-5483.
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.
Allen, Peter, Böttcher, Julia, Hladký, Jan and Piguet, Diana (2011) A density Corrádi-Hajnal theorem. Electronic Notes in Discrete Mathematics, Vol.38 . pp. 31-36. doi:10.1016/j.endm.2011.09.006 ISSN 1571-0653.
Christofides, Demetres, Hladký, Jan and Máthé, Andras (2011) A proof of the dense version of Lovász conjecture. Electronic Notes in Discrete Mathematics, Vol.38 . pp. 285-290. doi:10.1016/j.endm.2011.09.047 ISSN 1571-0653.
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.
Hladký, Jan and Schacht, Mathias (2010) Note on bipartite graph tilings. SIAM Journal on Discrete Mathematics, Vol.24 (No.2). p. 357. doi:10.1137/080726434 ISSN 0895-4801.
Hladký, Jan, Král', Daniel and Norin, Sergey (2009) Counting flags in triangle-free digraphs. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 621-625. doi:10.1016/j.endm.2009.07.105 ISSN 1571-0653.
Cooley, Oliver, Hladký, Jan and Piguet, Diana (2009) Loebl-Komlós-Sós conjecture : dense case. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 609-613. doi:10.1016/j.endm.2009.07.103 ISSN 1571-0653.
Allen, Peter, Böttcher, Julia, Hladký, Jan and Cooley, Oliver (2009) Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 75-79. doi:10.1016/j.endm.2009.07.013 ISSN 1571-0653.
Böttcher, Julia, Hladký, Jan and Piguet, Diana (2009) The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 597-601. doi:10.1016/j.endm.2009.07.101 ISSN 1571-0653.
Hladký, Jan, Kráal, Daniel, Sereni, Jean-Sébastien and Stiebitz, Michael (2008) List colorings with measurable sets. Journal of Graph Theory, Vol.59 (No.3). pp. 229-238. doi:10.1002/jgt.20335 ISSN 0364-9024.
Hladký, Jan, Novák, Jan, Pyrih, Pavel, Sterzik, Marek and Tancer, Martin (2006) An engine breaking the ΩEP-property. Topology and its Applications, Vol.153 (No.18). pp. 3621-3626. doi:10.1016/j.topol.2006.03.011 ISSN 0166-8641.
This list was generated on Thu Apr 25 13:07:35 2024 BST.