Publications (40)
A bound on the inducibility of cycles
Daniel Kral, Sergey Norin, Jan Volec
Third case of the Cyclic Coloring Conjecture
Michael Hebdige, Daniel Kral
Compactness and finite forcibility of graphons
Roman Glebov, Daniel Kral, Jan Volec
First order convergence and roots
Demetres Christofides, Daniel Kral
Counting flags in triangle-free digraphs
Jan Hladky, Daniel Kral, Sergey Norin
Infinite dimensional finitely forcible graphon
Roman Glebov, Tereza Klimosova, Daniel Kral
Optimal-size clique transversals in chordal graphs
Jacob W. Cooper, Andrzej Grzesik, Daniel Kral
Min-max relations for odd cycles in planar graphs
Daniel Kral, Jean-Sebastien Sereni, Ladislav Stacho
Non-three-colorable common graphs exist
Hamed Hatami, Jan Hladky, Daniel Kral +2
Recovering sparse graphs
Jakub Gajarsky, Daniel Kral
Decomposition width - a new width parameter for matroids
Daniel Kral
First order limits of sparse graphs: Plane trees and path-width
Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5
Deciding first order logic properties of matroids
Tomas Gavenciak, Daniel Kral, Sang-il Oum
Weak regularity and finitely forcible graph limits
Jacob W. Cooper, Tomas Kaiser, Daniel Kral +1
Graphic TSP in cubic graphs
Zdenek Dvorak, Daniel Kral, Bojan Mohar
An improved linear bound on the number of perfect matchings in cubic graphs
Louis Esperet, Daniel Kral, Petr Skoda +1
Finitely forcible graphons and permutons
Roman Glebov, Andrzej Grzesik, Tereza Klimosova +1
Fractional total colourings of graphs of high girth
Tomas Kaiser, Andrew King, Daniel Kral
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk
Zdenek Dvorak, Daniel Kral, Robin Thomas
The last fraction of a fractional conjecture
Frantisek Kardos, Daniel Kral, Jean-Sebastien Sereni
Hereditary properties of permutations are strongly testable
Tereza Klimosova, Daniel Kral
First order convergence of matroids
Frantisek Kardos, Daniel Kral, Anita Liebenau +1
Testing first-order properties for subclasses of sparse graphs
Zdenek Dvorak, Daniel Kral, Robin Thomas
A problem of Erdos and Sos on 3-graphs
Roman Glebov, Daniel Kral, Jan Volec
Permutations with fixed pattern densities
Richard Kenyon, Daniel Kral, Charles Radin +1
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Frantisek Kardos, Daniel Kral, Jan Volec
Domination number of cubic graphs with large girth
Daniel Kral, Petr Skoda, Jan Volec
A new lower bound based on Gromov's method of selecting heavily covered points
Daniel Kral, Lukas Mach, Jean-Sebastien Sereni
Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three
Tomas Kaiser, Daniel Kral, Bernard Lidicky +2
A note on edge-colourings avoiding rainbow K_4 and monochromatic K_m
Veselin Jungic, Tomas Kaiser, Daniel Kral
Packing six T-joins in plane graphs
Zdenek Dvorak, Ken-ichi Kawarabayashi, Daniel Kral
Exponentially many perfect matchings in cubic graphs
Louis Esperet, Frantisek Kardos, Andrew King +2
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
Classes of graphs with small rank decompositions are chi-bounded
Zdenek Dvorak, Daniel Kral
Extensions of Fractional Precolorings show Discontinuous Behavior
Jan van den Heuvel, Daniel Kral, Martin Kupec +2
Steinberg's Conjecture is false
Vincent Cohen-Addad, Michael Hebdige, Daniel Kral +2
Densities of 3-vertex graphs
Roman Glebov, Andrzej Grzesik, Ping Hu +3
FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlineny, Daniel Kral +3
Finitely forcible graph limits are universal
Jacob W. Cooper, Daniel Kral, Taisa L. Martins
Fractional colorings of cubic graphs with large girth
Frantisek Kardos, Daniel Kral, Jan Volec