Daniel Král'

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Strong modeling limits of graphs with bounded tree-width
(available as arXiv preprint)
N/APaper
Common graphs with arbitrary chromatic number
(available as arXiv preprint)
N/APaper
Twin-width of graphs on surfaces
(available as arXiv preprint)
N/APaper
The dimension of the feasible region of pattern densities
(available as arXiv preprint)
N/APaper
Branch-depth is minor closure of contraction-deletion-depth
(available as arXiv preprint)
N/APaper
Ramsey multiplicity of apices of trees
(available as arXiv preprint)
N/APaper
Hypergraphs with uniform Turán density equal to 8/27
Combinatorics, Probability and Computing
2026-07-24Paper
Strong modeling limits of graphs with bounded tree-width
European Journal of Combinatorics
2026-07-09Paper
Convergence of spectra of digraph limits
European Journal of Combinatorics
2026-07-09Paper
Twin-width of graphs on surfaces2026-05-12Paper
Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming2026-03-18Paper
Convergence of spectra of digraph limits
(available as arXiv preprint)
2026-01-01Paper
Sidorenko property and forcing in regular tournaments
(available as arXiv preprint)
2026-01-01Paper
Fundamental cycles in grid graphs
(available as arXiv preprint)
2026-01-01Paper
Solution of uniform Turán's Tetrahedron Problem
(available as arXiv preprint)
2026-01-01Paper
Closure property of contraction-depth of matroids
Journal of Combinatorial Theory. Series B
2025-09-16Paper
Common systems of two equations over the binary field2025-08-01Paper
Common graphs with arbitrary chromatic number
Compositio Mathematica
2025-07-27Paper
The dimension of the region of feasible tournament profiles
SIAM Journal on Discrete Mathematics
2025-07-10Paper
Deciding first-order properties for sparse graphs2025-04-29Paper
Forcing generalized quasirandom graphs efficiently (extended abstract)2025-04-15Paper
The dimension of the feasible region of pattern densities (extended abstract)2025-04-15Paper
The dimension of the feasible region of pattern densities
Mathematical Proceedings of the Cambridge Philosophical Society
2025-03-12Paper
Uniform Turán density -- palette classification
(available as arXiv preprint)
2025-01-01Paper
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Mathematical Programming. Series A. Series B
2024-11-07Paper
Forcing generalised quasirandom graphs efficiently
Combinatorics, Probability and Computing
2024-11-05Paper
Cycles of length three and four in tournaments
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
More non-bipartite forcing pairs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Planar graph with twin-width seven
European Journal of Combinatorics
2024-10-07Paper
Hypergraphs with minimum positive uniform Turán density2024-09-13Paper
Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming2024-06-24Paper
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations
Journal of Combinatorial Theory. Series B
2024-01-29Paper
Hypergraphs with uniform Turán density equal to 8/27
(available as arXiv preprint)
2024-01-01Paper
Forcing quasirandomness with 4-point permutations
(available as arXiv preprint)
2024-01-01Paper
Four-coloring Eulerian triangulations of the torus
(available as arXiv preprint)
2024-01-01Paper
Curves on the torus with few intersections
(available as arXiv preprint)
2024-01-01Paper
Quasirandom-Forcing Orientations of Cycles
SIAM Journal on Discrete Mathematics
2023-11-29Paper
Closure property of contraction-depth of matroids2023-11-03Paper
The dimension of the region of feasible tournament profiles2023-10-30Paper
Quasirandom Latin squares
Random Structures & Algorithms
2023-10-17Paper
Toward characterizing locally common graphs
Random Structures & Algorithms
2023-10-17Paper
Uniform Turán density of cycles
Transactions of the American Mathematical Society
2023-07-10Paper
Forcing Generalized Quasirandom Graphs Efficiently2023-03-07Paper
No additional tournaments are quasirandom-forcing
European Journal of Combinatorics
2022-12-01Paper
Cycles of a given length in tournaments
Journal of Combinatorial Theory. Series B
2022-11-23Paper
Inducibility and universality for trees
Combinatorial Theory
2022-11-23Paper
Density maximizers of layered permutations
The Electronic Journal of Combinatorics
2022-10-06Paper
Planar graph with twin-width seven2022-09-23Paper
Non-bipartite \(k\)-common graphs
Combinatorica
2022-06-30Paper
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
SIAM Journal on Computing
2022-06-08Paper
Packing and covering directed triangles asymptotically
European Journal of Combinatorics
2022-01-13Paper
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
Journal of Combinatorial Theory. Series B
2021-11-17Paper
Recovering sparse graphs
(available as arXiv preprint)
2021-08-04Paper
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
Journal of Combinatorial Theory. Series B
2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
Journal of Combinatorial Theory. Series B
2021-07-06Paper
Coloring graphs by translates in the circle
European Journal of Combinatorics
2021-06-18Paper
Elusive extremal graphs
Proceedings of the London Mathematical Society
2021-05-10Paper
Cyclic coloring of plane graphs with maximum face size 16 and 17
European Journal of Combinatorics
2021-04-14Paper
Analytic representations of large graphs
Surveys in Combinatorics 2019
2021-02-06Paper
Characterization of quasirandom permutations by a pattern sum
Random Structures & Algorithms
2021-01-05Paper
Finitely forcible graphons with an almost arbitrary structure
Discrete Analysis
2020-10-20Paper
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
Journal of Combinatorial Theory. Series B
2020-09-24Paper
Cycles of length three and four in tournaments
Journal of Combinatorial Theory. Series A
2020-07-03Paper
Permutations with fixed pattern densities
Random Structures & Algorithms
2020-06-19Paper
Non-bipartite k-common graphs
(available as arXiv preprint)
2020-06-16Paper
Hadwiger meets Cayley2020-05-12Paper
Decomposing graphs into edges and triangles
Combinatorics, Probability and Computing
2020-04-06Paper
Hadwiger meets Cayley
(available as arXiv preprint)
2020-01-01Paper
Compactness and finite forcibility of graphons
Journal of the European Mathematical Society (JEMS)
2019-10-15Paper
Hereditary properties of permutations are strongly testable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
More non-bipartite forcing pairs2019-06-10Paper
Packing directed cycles through a specified vertex set
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Infinite-dimensional finitely forcible graphon
Proceedings of the London Mathematical Society
2019-05-15Paper
Infinite-dimensional finitely forcible graphon
Proceedings of the London Mathematical Society
2019-05-15Paper
Coloring triangle-free graphs on surfaces2019-05-06Paper
Optimal‐size clique transversals in chordal graphs
Journal of Graph Theory
2019-01-03Paper
Optimal‐size clique transversals in chordal graphs
Journal of Graph Theory
2019-01-03Paper
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory. Series A
2018-12-19Paper
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory. Series A
2018-12-19Paper
A bound on the inducibility of cycles
Journal of Combinatorial Theory. Series A
2018-11-08Paper
A bound on the inducibility of cycles
Journal of Combinatorial Theory. Series A
2018-11-08Paper
Finitely forcible graph limits are universal
Advances in Mathematics
2018-11-08Paper
Finitely forcible graph limits are universal
Advances in Mathematics
2018-11-08Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
Journal of Combinatorial Theory. Series B
2018-07-24Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
Journal of Combinatorial Theory. Series B
2018-07-24Paper
Graphic TSP in cubic graphs
(available as arXiv preprint)
2018-04-19Paper
Walk entropy and walk-regularity
Linear Algebra and its Applications
2018-04-12Paper
Walk entropy and walk-regularity
Linear Algebra and its Applications
2018-04-12Paper
Weak regularity and finitely forcible graph limits
Transactions of the American Mathematical Society
2018-03-28Paper
Counting flags in triangle-free digraphs
Combinatorica
2018-03-16Paper
Extremal graph theory and finite forcibility2018-01-18Paper
Elusive extremal graphs
(available as arXiv preprint)
2018-01-01Paper
First-Order Convergence and Roots
Combinatorics, Probability and Computing
2017-10-10Paper
Recovering sparse graphs
(available as arXiv preprint)
2017-09-28Paper
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms
2017-08-10Paper
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms
2017-08-10Paper
Steinberg's conjecture is false
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Densities in large permutations and parameter testing
European Journal of Combinatorics
2016-11-07Paper
Third case of the cyclic coloring conjecture
(available as arXiv preprint)
2016-10-14Paper
Weak regularity and finitely forcible graph limits
(available as arXiv preprint)
2016-10-14Paper
Weak regularity and finitely forcible graph limits2016-10-14Paper
First order convergence of matroids
European Journal of Combinatorics
2016-10-12Paper
Densities of 3-vertex graphs2016-10-07Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
Journal of Combinatorial Theory. Series B
2016-06-03Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
Journal of Combinatorial Theory. Series B
2016-06-03Paper
A problem of Erdős and Sós on 3-graphs
Israel Journal of Mathematics
2016-04-21Paper
Third case of the cyclic coloring conjecture
SIAM Journal on Discrete Mathematics
2016-04-04Paper
FO model checking of interval graphs
Logical Methods in Computer Science
2016-01-07Paper
Densities of 3-vertex graphs
(available as arXiv preprint)
2016-01-01Paper
Packing six \(T\)-joins in plane graphs
Journal of Combinatorial Theory. Series B
2015-12-11Paper
← Previous 100   1   2   3   Next 100 →


Research outcomes over time


This page was built for person: Daniel Král'