2021

Dvořák, Zdeněk, Hebdige , Michael, Hlasek, Filip, Králʼ, Daniel and Noel, Jonathan A. (2021) Cyclic coloring of plane graphs with maximum face size 16 and 17. European Journal of Combinatorics . (In Press)

2020

Grzesik, Andrzej, Králʼ, Daniel and Lovász, Miklós (2020) Elusive extremal graphs. Proceedings of the London Mathematical Society, 121 (6). pp. 1685-1736. doi:10.1112/plms.12382

Dvořák, Zdeněk, Král', Daniel and Thomas, Robin (2020) Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. Journal of Combinatorial Theory, Series B, 145 . pp. 376-432. doi:10.1016/j.jctb.2020.06.005

Chan, Timothy F. N., Grzesik, Andrzej, Králʼ, Daniel and Noel, Jonathan A. (2020) Cycles of length three and four in tournaments. Journal of Combinatorial Theory, Series A, 175 . 105276. doi:10.1016/j.jcta.2020.105276

Chan, T., Králʼ, Daniel, Noel, Jonathan A., Pehova, Yanitsa, Sharifzadeh, Maryam and Volec, Jan (2020) Characterization of quasirandom permutations by a pattern sum. Random Structures and Algorithms . doi:10.1002/rsa.20956 (In Press)

Králʼ, Daniel, Lovasz, Laszlo M., Noel, Jonathan A. and Sosnovec, Jakub (2020) Finitely forcible graphons with an almost arbitrary structure. Discrete Analysis . (In Press)

Králʼ, Daniel, Noel, J., Norine, S., Volec, J. and Wei, F. (2020) Non-bipartite k-common graphs. Combinatorica . (In Press)

Dvořák, Zdeněk, Král', Daniel and Thomas, Robin (2020) Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. Journal of Combinatorial Theory, Series B . doi:10.1016/j.jctb.2020.09.001 (In Press)

Dvořák, Zdeněk, Králʼ, Daniel and Thomas, Robin (2020) Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. Journal of Combinatorial Theory Series B . doi:10.1016/j.jctb.2020.04.006 (In Press)

2019

Kenyon, Robert V., Králʼ, Daniel, Radin, C. and Winkler, P. (2019) Permutations with fixed pattern densities. Random Structures and Algorithms . doi:10.1002/rsa.20882 (In Press)

Hubai, Tamàs, Král', Daniel, Parczyk, Olaf and Person, Yury (2019) Person : more non-bipartite forcing pairs. In: EuroComb 2019, Bratislava, Slovakia, 26-30 Aug 2019. Published in: Acta Mathematica Universitatis Comenianae ISSN 0862-9544. (In Press)

Králʼ, Daniel, Lidicky, Bernard, Martins, Taisa and Pehova, Yanitsa (2019) Decomposing graphs into edges and triangles. Combinatorics, Probability and Computing, 28 (3). pp. 465-472. doi:10.1017/S0963548318000421

Glebov, Roman, Králʼ, Daniel and Volec, Jan (2019) Compactness and finite forcibility of graphons. Journal of the European Mathematical Society . (In Press)

Králʼ, Daniel, Martins, Taísa L., Pach, Péter Pál and Wrochna, Marcin (2019) The step Sidorenko property and non-norming edge-transitive graphs. Journal of Combinatorial Theory Series A, 162 . pp. 34-54. doi:10.1016/j.jcta.2018.09.012

Králʼ, Daniel, Martins, Taísa L., Pach, Péter Pál and Wrochna, Marcin (2019) The step Sidorenko property and non-norming edge-transitive graphs. Journal of Combinatorial Theory, Series A, 162 . pp. 34-54. doi:10.1016/j.jcta.2018.09.012

Králʼ, Daniel, Norin, Sergey and Volec, Jan (2019) A bound on the inducibility of cycles. Journal of Combinatorial Theory Series A, 161 . pp. 359-363. doi:10.1016/j.jcta.2018.08.003

Král', Daniel, Norin, Sergey and Volec, Jan (2019) A bound on the inducibility of cycles. Journal of Combinatorial Theory, Series A, 161 . pp. 359-363. doi:10.1016/j.jcta.2018.08.003

2018

Cooper, Jacob W., Králʼ, Daniel and Martins, Taísa L. (2018) Finitely forcible graph limits are universal. Advances in Mathematics, 340 . pp. 819-854. doi:10.1016/j.aim.2018.10.019

Glebov, Roman, Klimošová, Tereza and Králʼ, Daniel (2018) Infinite dimensional finitely forcible graphon. Proceedings of the London Mathematical Society . doi:10.1112/plms.12203 (In Press)

Cooper, Jacob W., Grzesik, Andrzej and Králʼ, Daniel (2018) Optimal-size clique transversals in chordal graphs. Journal of Graph Theory . doi:10.1002/jgt.22362 (In Press)

Dvořák, Zdeněk, Králʼ, Daniel and Thomas, Robin (2018) Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. Journal of Combinatorial Theory Series B . doi:10.1016/j.jctb.2018.03.001 (In Press)

Cooper, Jacob W., Kaiser, Tomas, Králʼ, Daniel and Noel, Jonathan (2018) Weak regularity and finitely forcible graph limits. Transactions of the American Mathematical Society . doi:10.1090/tran/7066

Kloster, Kyle, Králʼ, Daniel and Sullivan, Blair D. (2018) Walk entropy and walk-regularity. Linear Algebra and Its Applications . doi:10.1016/j.laa.2018.02.009 (In Press)

Gajarsky, Jakub and Králʼ, Daniel (2018) Recovering sparse graphs. Leibniz International Proceedings in Informatics (LIPIcs), 117 . 29:1-29:15. 29. doi:10.4230/LIPIcs.MFCS.2018.29

2017

Grzesik, Andrzej, Králʼ, Daniel and Lovasz, Laszlo Miklos (2017) Extremal graph theory and finite forcibility. Electronic Notes in Discrete Mathematics, 61 . pp. 541-547. doi:10.1016/j.endm.2017.07.005

Gajarsky, Jakub, Hlineny, Petr, Kaiser, Tomas, Králʼ, Daniel, Kupec, Martin, Obdrzalek, Jan, Ordyniak, Sebastian and Tuma, Vojtech (2017) First order limits of sparse graphs : plane trees and path-width. Random Structures and Algorithms, 50 (4). pp. 612-635. doi:10.1002/rsa.20676

Glebov, Roman, Hoppen, Carlos, Klimosova, Tereza, Kohayakawa, Yoshiharu, Králʼ, Daniel and Liu, Hong (2017) Densities in large permutations and parameter testing. European Journal of Combinatorics, 60 . pp. 89-99. doi:10.1016/j.ejc.2016.09.006

Kardos, Frantisek, Králʼ, Daniel, Liebenau, Anita and Mach, Lukáš (2017) First order convergence of matroids. European Journal of Combinatorics, 59 . pp. 150-168. doi:10.1016/j.ejc.2016.08.005

Cohen-Addad, Vincent, Hebdige, Michael, Králʼ, Daniel, Li, Zhentao and Salgado, Esteban (2017) Steinberg's conjecture is false. Journal of Combinatorial Theory, Series B, 122 . pp. 452-456. doi:10.1016/j.jctb.2016.07.006

Dvořák, Zdeněk, Králʼ, Daniel and Mohar, Bojan (2017) Graphic TSP in cubic graphs. In: 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8-11 Mar 2017. Published in: Leibniz International Proceedings in Informatics (LIPIcs), 66 ISBN 9783959770286. ISSN 1868-8969.

2016

Dvorak, Zdenek, Králʼ, Daniel and Thomas, Robin (2016) Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. Journal of Combinatorial Theory, Series B, 120 . pp. 1-17. doi:10.1016/j.jctb.2016.04.003

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

Hebdige, Michael and Králʼ, Daniel (2016) Third case of the cyclic coloring conjecture. SIAM Journal on Discrete Mathematics, 30 (1). pp. 525-548. doi:10.1137/15M1019490

Christofides, Demetres and Králʼ, Daniel (2016) First order convergence and roots. Combinatorics, Probability and Computing, 25 (2). pp. 213-221. doi:10.1017/S0963548315000048

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

Dvorak, Z., Kawarabayashi, K. and Králʼ, Daniel (2016) Packing six T-joins in plane graphs. Journal of Combinatorial Theory, Series B, 116 . pp. 287-305. doi:10.1016/j.jctb.2015.09.002

2015

Ganian, Robert, Hliněný, Petr , Králʼ, Daniel, Obdržálek, Jan, Schwartz, Jarett and Teska, Jakub (2015) FO model checking of interval graphs. Logical Methods in Computer Science, 11 (4). pp. 1-20. 11. doi:10.2168/LMCS-11(4:11)2015

Hebdige, Michael and Král', Daniel (2015) Third case of the cyclic coloring conjecture. In: The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, Bergen, Norway, 31 Aug 4 Sep 2015. Published in: Electronic Notes in Discrete Mathematics, 49 pp. 11-15. ISSN 1571-0653. doi:10.1016/j.endm.2015.06.003

Glebov, Roman, Grzesik, Andrzej, Klimošová, Tereza and Králʼ, Daniel (2015) Finitely forcible graphons and permutons. Journal of Combinatorial Theory. Series B, Volume 110 (Number ). pp. 112-135. doi:DOI: 10.1016/j.jctb.2014.07.007

2014

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

Klimošová , Tereza and Králʼ, Daniel (2014) Hereditary properties of permutations are strongly testable. In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), Portland, USA, 5-7 Jan 2014. Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1164-1173. ISBN 9781611973389.

Ferguson, David G. (Researcher in mathematics), Kaiser, Thomáš and Králʼ, Daniel (2014) The fractional chromatic number of triangle-free subcubic graphs. European Journal of Combinatorics, Volume 35 . pp. 184-220. doi:10.1016/j.ejc.2013.06.006

2013

Dvořák, Zdeněk, Králʼ, Daniel and Thomas, Robin (2013) Testing first-order properties for subclasses of sparse graphs. Journal of the ACM, Volume 60 (Number 5). Article number 36. doi:10.1145/2499483

Cummings, James, Králʼ, Daniel, Pfender, Florian, Sperfeld, Konrad, Treglown, Andrew and Young, Michael (2013) Monochromatic triangles in three-coloured graphs. Journal of Combinatorial Theory, Series B, Volume 103 (Number 4). pp. 489-503. doi:10.1016/j.jctb.2013.05.002

Král', Daniel, Liu, Chun-Hung, Sereni, Jean-Sébastien, Whalen, Peter and Yilma, Zelealem B. (2013) A new bound for the 2/3 conjecture. Combinatorics, Probability and Computing, Volume 22 (Number 3). pp. 384-393. doi:10.1017/S0963548312000612

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

Král’, Daniel and Pikhurko, Oleg (2013) Quasirandom permutations are characterized by 4-point densities. Geometric and Functional Analysis, Volume 23 (Number 2). pp. 570-579. doi:10.1007/s00039-013-0216-9

Ganian, R., Hliněný, P., Král', Daniel, Obdržálek, J., Schwartz, J. and Teska, J. (2013) FO model checking of interval graphs. In: Freivalds, Rūsiņš and Kwiatkowska, Martha and Fomin, Fedor V. and Peleg , David, (eds.) Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science, Volume 7966 . Berlin ; London: Springer Berlin Heidelberg, pp. 250-262. ISBN 9783642392115

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

2012

Král’, Daniel, Mach, Lukáš and Sereni, Jean-Sébastien (2012) A new lower bound based on Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry, Vol.48 (No.2). pp. 487-498. doi:10.1007/s00454-012-9419-3

Králʼ, Daniel, Serra, Oriol and Vena, Lluís (2012) A removal lemma for systems of linear equations over finite fields. Israel Journal of Mathematics, Vol.187 (No.1). pp. 193-207. doi:10.1007/s11856-011-0080-y

2011

Esperet, Louis, Kardoš, František, King, Andrew D., Králʼ, Daniel and Norine, Serguei (2011) Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, Vol.227 (No.4). pp. 1646-1664. doi:10.1016/j.aim.2011.03.015

Kaiser, Tomáš, King, Andrew D. and Králʼ, Daniel (2011) Fractional total colourings of graphs of high girth. Journal of Combinatorial Theory, Series B, Vol. 101 (No. 6). pp. 383-402. doi:10.1016/j.jctb.2010.12.005

2010

Král', Daniel, Máčajová, Edita, Pór, Attila and Sereni, Jean-Sébastien (2010) Characterisation results for Steiner Triple Systems and their application to edge-colourings of cubic graphs. Canadian Journal of Mathematics, Vol.62 (No.2). pp. 355-381. doi:10.4153/CJM-2010-021-9

2009

Král', Daniel, Serra, Oriol and Vena, Lluís (2009) A combinatorial proof of the Removal Lemma for Groups. Journal of Combinatorial Theory, Series A, Vol.116 (No.4). pp. 971-978. doi:10.1016/j.jcta.2008.12.003