Search Results - "Kral, Daniel"

Planar graph with twin-width seven by Král’, Daniel, Lamaison, Ander

“…We construct a planar graph with twin-width equal to seven…”
Get full text

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming by Briański, Marcin, Koutecký, Martin, Král’, Daniel, Pekárková, Kristýna, Schröder, Felix

“…An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint…”
Get full text

Steinberg's Conjecture is false by Cohen-Addad, Vincent, Hebdige, Michael, Král', Daniel, Li, Zhentao, Salgado, Esteban

“…Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture…”
Get full text

Permutations with fixed pattern densities by Kenyon, Richard, Král', Daniel, Radin, Charles, Winkler, Peter

“…We study scaling limits of random permutations (“permutons”) constrained by having fixed densities of a finite number of patterns. We show that the limit…”
Get full text

On the number of pentagons in triangle-free graphs by Hatami, Hamed, Hladký, Jan, Králʼ, Daniel, Norine, Serguei, Razborov, Alexander

“…Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)5 cycles of length five. Moreover, the…”
Get full text

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations by Dvořák, Zdeněk, Král', Daniel, Thomas, Robin

Get full text

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies by Dvořák, Zdeněk, Král', Daniel, Thomas, Robin

“…We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at…”
Get full text

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm by Dvořák, Zdeněk, Král', Daniel, Thomas, Robin

“…We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a…”
Get full text

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs by Dvořák, Zdeněk, Král', Daniel, Thomas, Robin

“…Let G be a 4-critical graph with t triangles, embedded in a surface of genus g. Let c be the number of 4-cycles in G that do not bound a 2-cell face. We prove…”
Get full text

Density Maximizers of Layered Permutations by Kabela, Adam, Kráľ, Daniel, Noel, Jonathan A, Pierron, Théo

“…A permutation is layered if it contains neither $231$ nor $312$ as a pattern.It is known that, if $\sigma$ is a layered permutation, then the density of…”
Get full text

A problem of Erdős and Sós on 3-graphs by Glebov, Roman, Král’, Daniel, Volec, Jan

“…We show that for every ɛ > 0 there exist δ > 0 and n 0 ∈ ℕ such that every 3-uniform hypergraph on n ≥ n 0 vertices with the property that every k -vertex…”
Get full text

Non-Bipartite K-Common Graphs by Král’, Daniel, Noel, Jonathan A., Norin, Sergey, Volec, Jan, Wei, Fan

“…A graph H is k -common if the number of monochromatic copies of H in a k -edge-coloring of K n is asymptotically minimized by a random coloring. For every k ,…”
Get full text

Weak regularity and finitely forcible graph limits by COOPER, JACOB W., KAISER, TOMÁŠ, KRÁL’, DANIEL, NOEL, JONATHAN A.

“…Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e.,…”
Get full text

Cycles of a given length in tournaments by Grzesik, Andrzej, Král', Daniel, Lovász, László M., Volec, Jan

“…We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let c(ℓ) be the limit of the ratio of the maximum…”
Get full text

Quasirandom Latin squares by Cooper, Jacob W., Král', Daniel, Lamaison, Ander, Mohr, Samuel

“…We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2×3 pattern is…”
Get full text

First order convergence of matroids by Kardoš, František, Král’, Daniel, Liebenau, Anita, Mach, Lukáš

“…The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini–Schramm…”
Get full text

Toward characterizing locally common graphs by Hancock, Robert, Král', Daniel, Krnc, Matjaž, Volec, Jan

“…A graph H$$ H $$ is common if the number of monochromatic copies of H$$ H $$ in a 2‐edge‐coloring of the complete graph is asymptotically minimized by the…”
Get full text

Finitely forcible graphons and permutons by Glebov, Roman, Grzesik, Andrzej, Klimošová, Tereza, Král', Daniel

“…We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e.,…”
Get full text

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs by Kardoš, František, Král′, Daniel, Volec, Jan

“…We show that for every cubic graph Gwith sufficiently large girth there exists a probability distribution on edge‐cuts in Gsuch that each edge is in a randomly…”
Get full text

Decomposition width of matroids by Daniel, Kral'

“…Hliněný [P. Hliněný, Branch-width, parse trees, and monadic second-order logic for matroids, J. Combin. Theory Ser. B 96 (2006), 325–351] showed that every…”
Get full text