Daniel Král'

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 37

Top Topics

Top Venues

J. Comb. Theory, Ser. B

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

Andrzej Grzesik, Daniel Král', Oleg Pikhurko
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33 (1) (2024)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. J. Comb. Theory, Ser. B 164 (2024)
Andrzej Grzesik, Daniel Il'kovic, Bartlomiej Kielak, Daniel Král'
Quasirandom-Forcing Orientations of Cycles. SIAM J. Discret. Math. 37 (4) (2023)
Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec
Toward characterizing locally common graphs. Random Struct. Algorithms 62 (1) (2023)
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108 (2023)
Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec
Cycles of a given length in tournaments. J. Comb. Theory, Ser. B 158 (Part) (2023)
Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP (2022)
Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei
Non-Bipartite K-Common Graphs. Comb. 42 (1) (2022)
Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron
Density Maximizers of Layered Permutations. Electron. J. Comb. 29 (3) (2022)
Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr
Quasirandom Latin squares. Random Struct. Algorithms 61 (2) (2022)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory, Ser. B 152 (2022)
Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král'
Packing and covering directed triangles asymptotically. Eur. J. Comb. 101 (2022)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory, Ser. B 150 (2021)
Zdenek Dvorák, Michael Hebdige, Filip Hlásek, Daniel Král', Jonathan A. Noel
Cyclic coloring of plane graphs with maximum face size 16 and 17. Eur. J. Comb. 94 (2021)
Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena
Coloring graphs by translates in the circle. Eur. J. Comb. 96 (2021)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory, Ser. B 150 (2021)
Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11 (8) (2021)
Timothy F. N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel
Cycles of length three and four in tournaments. J. Comb. Theory, Ser. A 175 (2020)
Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec
Characterization of quasirandom permutations by a pattern sum. Random Struct. Algorithms 57 (4) (2020)
Richard W. Kenyon, Daniel Král', Charles Radin, Peter Winkler
Permutations with fixed pattern densities. Random Struct. Algorithms 56 (1) (2020)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory, Ser. B 145 (2020)
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming. ICALP (2020)
Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova
Decomposing Graphs into Edges and Triangles. Comb. Probab. Comput. 28 (3) (2019)
Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna
The step Sidorenko property and non-norming edge-transitive graphs. J. Comb. Theory, Ser. A 162 (2019)
Daniel Král', Sergey Norin, Jan Volec
A bound on the inducibility of cycles. J. Comb. Theory, Ser. A 161 (2019)
Andrzej Grzesik, Daniel Král', László Miklós Lovász
Elusive extremal graphs. CoRR (2018)
Jacob W. Cooper, Andrzej Grzesik, Daniel Král'
Optimal-size clique transversals in chordal graphs. J. Graph Theory 89 (4) (2018)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory, Ser. B 132 (2018)
Andrzej Grzesik, Daniel Král', László Miklós Lovász
Extremal graph theory and finite forcibility. Electron. Notes Discret. Math. 61 (2017)
Vincent Cohen-Addad, Michael Hebdige, Daniel Král', Zhentao Li, Esteban Salgado
Steinberg's Conjecture is false. J. Comb. Theory, Ser. B 122 (2017)
Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach
First order convergence of matroids. Eur. J. Comb. 59 (2017)
Jan Hladký, Daniel Král', Sergey Norin
Counting flags in triangle-free digraphs. Comb. 37 (1) (2017)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
Densities in large permutations and parameter testing. Eur. J. Comb. 60 (2017)
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50 (4) (2017)
Demetres Christofides, Daniel Král'
First-Order Convergence and Roots. Comb. Probab. Comput. 25 (2) (2016)
Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král'
Packing six T-joins in plane graphs. J. Comb. Theory, Ser. B 116 (2016)
Zdenek Dvorák, Daniel Král', Robin Thomas
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory, Ser. B 120 (2016)
Michael Hebdige, Daniel Král'
Third case of the Cyclic Coloring Conjecture. Electron. Notes Discret. Math. 49 (2015)
Jacob W. Cooper, Tomás Kaiser, Daniel Král', Jonathan A. Noel
Weak regularity and finitely forcible graph limits. Electron. Notes Discret. Math. 49 (2015)
David G. Ferguson, Tomás Kaiser, Daniel Král'
The fractional chromatic number of triangle-free subcubic graphs. Eur. J. Comb. 35 (2014)
Tereza Klimosová, Daniel Král'
Hereditary properties of permutations are strongly testable. SODA (2014)
Roman Glebov, Daniel Král', Jan Volec
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes Discret. Math. 43 (2013)
Jan Hladký, Daniel Král', Serguei Norine
Rank of divisors on tropical curves. J. Comb. Theory, Ser. A 120 (7) (2013)
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
FO Model Checking of Interval Graphs. ICALP (2) (2013)
Daniel Král', Oriol Serra, Lluís Vena
On the removal lemma for linear systems over Abelian groups. Eur. J. Comb. 34 (2) (2013)
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
On the number of pentagons in triangle-free graphs. J. Comb. Theory, Ser. A 120 (3) (2013)
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma
A New Bound for the 2/3 Conjecture. Comb. Probab. Comput. 22 (3) (2013)
Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer
Packing directed cycles through a specified vertex set. SODA (2013)
James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young
Monochromatic triangles in three-coloured graphs. J. Comb. Theory, Ser. B 103 (4) (2013)
Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho
Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33 (3) (2012)
Daniel Král', Petr Skoda, Jan Volec
Domination number of cubic graphs with large girth. J. Graph Theory 69 (2) (2012)
Zdenek Dvorák, Daniel Král'
Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33 (4) (2012)
Daniel Král', Lukás Mach, Jean-Sébastien Sereni
A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 48 (2) (2012)
Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki
Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. 28 (4) (2012)
Louis Esperet, Frantisek Kardos, Daniel Král'
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. Eur. J. Comb. 33 (5) (2012)
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21 (5) (2012)
Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec
Extending Fractional Precolorings. SIAM J. Discret. Math. 26 (2) (2012)
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma
A new bound for the 2/3 conjecture CoRR (2012)
Daniel Král'
Decomposition width of matroids. Discret. Appl. Math. 160 (6) (2012)
Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26 (3) (2012)
Frantisek Kardos, Daniel Král', Jan Volec
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41 (4) (2012)
Manuel Bodirsky, Daniel Král'
Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discret. Math. 25 (2) (2011)
Tomás Kaiser, Andrew D. King, Daniel Král'
Fractional total colourings of graphs of high girth. J. Comb. Theory, Ser. B 101 (6) (2011)
Frantisek Kardos, Daniel Král', Jan Volec
Fractional colorings of cubic graphs with large girth. SIAM J. Discret. Math. 25 (3) (2011)
Pavel Klavík, Daniel Král', Lukás Mach
Triangles in arrangements of points and lines in the plane. J. Comb. Theory, Ser. A 118 (3) (2011)
Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal
Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discret. Math. 24 (1) (2010)
Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski
An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31 (5) (2010)
Zdenek Dvorák, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni
A note on antisymmetric flows in graphs. Eur. J. Comb. 31 (1) (2010)
Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
Pattern Hypergraphs. Electron. J. Comb. 17 (1) (2010)
Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni
The Last Fraction of a Fractional Conjecture. SIAM J. Discret. Math. 24 (2) (2010)
Daniel Král', Ladislav Stacho
Coloring plane graphs with independent crossings. J. Graph Theory 64 (3) (2010)
Zdenek Dvorák, Daniel Král', Jakub Teska
-minor-free graphs. Discret. Math. 310 (3) (2010)
Daniel Král'
Decomposition Width of Matroids. ICALP (1) (2010)
Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz
Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100 (6) (2010)
Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory, Ser. B 100 (4) (2010)
Daniel Král', Serguei Norine, Ondrej Pangrác
-minor free graphs. J. Comb. Theory, Ser. A 117 (6) (2010)
Jan Hladký, Daniel Král', Uwe Schauz
Brooks' Theorem via the Alon-Tarsi Theorem. Discret. Math. 310 (23) (2010)
Zdenek Dvorák, Daniel Král', Riste Skrekovski
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory 63 (2) (2010)
Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski
Facial colorings using Hall's Theorem. Eur. J. Comb. 31 (3) (2010)
Veselin Jungic, Tomás Kaiser, Daniel Král'
. Electron. J. Comb. 16 (1) (2009)
Daniel Král', Douglas B. West
Chromatic Number for a Generalization of Cartesian Product Graphs. Electron. J. Comb. 16 (1) (2009)
Daniel Král', Li-Da Tong, Xuding Zhu
Upper hamiltonian numbers and hamiltonian spectra of graphs. Australas. J Comb. 35 (2006)
Daniel Král'
A counter-example to Voloshin's hypergraph co-perfectness conjecture. Australas. J Comb. 27 (2003)