prof. RNDr. Daniel Kráľ, Ph.D., DSc.
Professor, Department of Computer Science
office: C517
Botanická 554/68a
602 00 Brno
phone: | +420 549 49 6337 |
---|---|
e‑mail: |
social and academic networks: |
---|
Total number of publications: 177
2020
-
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five
Journal of Combinatorial Theory. Series B, year: 2020, volume: 145, edition: November 2020, DOI
2019
-
A bound on the inducibility of cycles
Journal of Combinatorial Theory, Series A, year: 2019, volume: 161, edition: January 2019
-
Analytic representations of large graphs
Surveys in Combinatorics 2019, year: 2019
-
Compactness and finite forcibility of graphons
Journal of the European Mathematical Society, year: 2019, volume: 21, edition: 10, DOI
-
CYCLES OF LENGTH THREE AND FOUR IN TOURNAMENTS
Acta Mathematica Universitatis Comenianae, year: 2019, volume: 88, edition: 3
-
Infinite-dimensional finitely forcible graphon
Proceedings of the London mathematical society, year: 2019, volume: 118, edition: 4, DOI
-
MORE NON-BIPARTITE FORCING PAIRS
Acta Mathematica Universitatis Comenianae, year: 2019, volume: 88, edition: 3
-
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory, Series A, year: 2019, volume: 162, edition: 1, DOI
2018
-
Finitely forcible graph limits are universal
Advances in Mathematics, year: 2018, volume: 340, edition: December, DOI
-
Optimal-size clique transversals in chordal graphs
Journal of Graph Theory, year: 2018, volume: 89, edition: 4, DOI