166 citations · 647 across the 62 of their papers we have counts for
87 papers
The dimension of the feasible region of pattern densities
Frederik Garbe, Daniel Kral, Alexandru Malekshahian +1
A classical result of Erdős, Lovász and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs…
Twin-width of graphs on surfaces
Daniel Kráľ, Kristýna Pekárková, Kenny Štorgel
Twin-width is a width parameter introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twin…
Forcing Generalized Quasirandom Graphs Efficiently
Andrzej Grzesik, Daniel Kral, Oleg Pikhurko
We study generalized quasirandom graphs whose vertex set consists of parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distri…
Planar graph with twin-width seven
Daniel Kral, Ander Lamaison
We construct a planar graph with twin-width equal to seven.
Common graphs with arbitrary chromatic number
Daniel Kral, Jan Volec, Fan Wei
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that th…
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Marcin Brianski, Martin Koutecky, Daniel Kral +2
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix and the n…