Preprints

F. Garbe, R. Hancock, J. Hladky, M. Sharifzadeh: Limits of Latin squares
[arXiv]. [Extended abstract] appeared in the proceedings of Eurocomb 2019 [here]

M. Dolezal, J. Grebik, J. Hladky, I. Rocha, V. Rozhon: Cut distance identifying graphon parameters over weak* limits
[arXiv]

Accepted

J. Hladky, C. Pelekis, M. Sileikis: A limit theorem for small cliques in inhomogeneous random graphs
accepted to Journal of Graph Theory, [arXiv], [published]

M. Dolezal, J. Hladky, J. Kolar, T. Mitsis, C. Pelekis, V. Vlasak: A Turantype theorem for largedistance graphs in Euclidean spaces, and related isodiametric problems
accepted to Discrete & Computational Geometry, [arXiv], [published]. [Here] is an identical copy of the published paper available as open access. [Extended abstract] appeared in the proceedings of Eurocomb 2019 [here]

F. Garbe, J. Hladky, J. Lee: Two remarks on graph norms
accepted to Discrete & Computational Geometry, [arXiv], [published]

2021

M. Dolezal, J. Grebik, J. Hladky, I. Rocha, V. Rozhon: Relating the cut distance and the weak* topology for graphons
Journal of Combinatorial Theory, series B, Volume 147, 2021, Pages 252298, [arXiv], [published]

J. Hladky, P. Hu, D. Piguet: Tilings in graphons
European Journal of Combinatorics 93 (2021), 103284. [arXiv], [published]

2020

A. Adamaszek, P. Allen, C. Grosu, J. Hladky: Almost all trees are almost graceful
Random Structures and Algorithms Volume 56 (4), pages 948987, [arXiv], [published]

J. Hladky, I. Rocha: Independent sets, cliques, and colorings in graphons
European Journal of Combinatorics, Volume 88, 103108, [arXiv], [published]

2019

P. Allen, J. Bottcher, J. Hladky, D. Piguet: Packing degenerate graphs
Advances in Mathematics, Volume 354, 106739. [arXiv], [published]
A description of the result is available as an announcement [here]. A version of this announcement which was shortened by ca 1.5 pages for publication purposes appeared in the Proceedings of Eurocomb 2017 [here].

M. Dolezal, J. Hladky: Cutnorm and entropy minimization over weak* limits
Journal of Combinatorial Theory, series B, 137, pages 232263. [arXiv], [published]

J. Hladky, P. Hu, D. Piguet: Komlos's tiling theorem via graphon covers
Journal of Graph Theory, 90(1), pages 2445. [arXiv], [published]

M. Dolezal, J. Hladky: Matching polytons
Electronic Journal of Combinatorics, Volume 26, Issue 4 (2019), P4.38, [arXiv], [published]
A summary of this paper and of "Tilings in graphons" appeared in the Proceedings of Eurocomb 2017 [here].

2018

J. Hladky, A. Nachmias, T. Tran: The local limit of the uniform spanning tree on dense graphs
Journal of Statistical Physics 173 (2018), no. 34, 502545. [arXiv], [published]. [Here] is an identical copy of the published paper available as open access.

2017

M. Dolezal, J. Hladky, A. Mathe: Cliques in dense inhomogeneous random graphs
Random structures and algorithms, 51(2), pages 275314. [arXiv], [published]
There is some analogy between cliques in graphs and increasing subsequences in permutations. In that sense, the permutation counterpart to our main result is [Deuschel and Zeitouni: "Limiting curves for iid records", Annals of Probability, 23 (1995), pp. 852878.]

J. Hladky, J. Komlos, D. Piguet, M. Simonovits, M. Stein, E. Szemeredi: The approximate LoeblKomlosSos Conjecture I: The sparse decomposition
SIAM Journal on Discrete Mathematics, 31(2), pages 945982. [arXiv]; [copy of the published version], [published]

J. Hladky, J. Komlos, D. Piguet, M. Simonovits, M. Stein, E. Szemeredi: The approximate LoeblKomlosSos Conjecture II: The rough structure of LKS graphs
SIAM Journal on Discrete Mathematics, 31(2), pages 9831016. [arXiv]; [copy of the published version], [published]

J. Hladky, J. Komlos, D. Piguet, M. Simonovits, M. Stein, E. Szemeredi: The approximate LoeblKomlosSos Conjecture III: The finer structure of LKS graphs
SIAM Journal on Discrete Mathematics, 31(2), pages 10171071. [arXiv]; [copy of the published version], [published]

J. Hladky, J. Komlos, D. Piguet, M. Simonovits, M. Stein, E. Szemeredi: The approximate LoeblKomlosSos Conjecture IV: Embedding techniques and the proof of the main result
SIAM Journal on Discrete Mathematics, 31(2), pages 10721148. [arXiv]; [copy of the published version], [published]

J. Hladky, D. Kral, S. Norine: Counting flags in trianglefree digraphs
Combinatorica 37 (2017), no. 1, 49176; [arXiv], [published]. [Here] is an identical copy of the published paper available as open access
extended abstract appeared in proceedings of Eurocomb 2009, Electronic Notes in Discrete Mathematics; [link]

P. Csikvari, P. Frenkel, J. Hladky, T. Hubai: Chromatic roots and limits of dense graphs
Discrete Mathematics, Volume 340, Issue 5, 2017, p. 11291135; [arXiv], [published]

2016

M. Adamaszek, J. Hladky: Upper bound theorem for odddimensional flag triangulations of manifolds
Mathematika, volume 62, issue 03, pp. 909928; [arXiv], [published]

J. Hladky, D. Piguet: LoeblKomlosSos Conjecture: dense case
Journal of Combinatorial Theory, Series B 116, (2016), p. 123190; [arXiv], [published]
extended abstract coauthored by O. Cooley appeared in proceedings of Eurocomb 2009, Electronic Notes in Discrete Mathematics; [link]

J. Bottcher, J. Hladky, D. Piguet, A. Taraz: An approximate version of the Tree Packing Conjecture
Israel Journal of Mathematics, vol. 211, issue 1, pp 391446; [arXiv], [published]
extended abstract appeared in the proceedings of RANDOM 2014; [link]

2015

P. Allen, J. Bottcher, J. Hladky, D. Piguet: A density CorradiHajnal theorem
Canadian Journal of Mathematics 67 (4), (2015), p.721758; [arXiv] (where you can also find auxiliary computer algebra files); [published]
extended abstract appeared in proceedings of Eurocomb 2011, Electronic Notes in Discrete Mathematics [link]

J. Hladky, D. Piguet, M. Simonovits, M. Stein, E. Szemeredi: The approximate LoeblKomlosSos conjecture and embedding trees in sparse graphs
Electronic Research Announcements in Mathematical Sciences 22, p.111; [arXiv], [published]

M. Adamaszek, J. Hladky: Dense flag triangulations of 3manifolds via extremal graph theory
Transactions of the American Mathematical Society 367, 27432764; [arXiv], [published]

J. Hladky, A. Mathe, V. Patel, O. Pikhurko: Poset limits can be totally ordered
Transactions of the American Mathematical Society 367 (2015), 43194337; [arXiv], [published]

2014

P. Allen, J. Bottcher, J. Hladky, D. Piguet: An extension of Turan's Theorem, uniqueness and stability
Electronic Journal of Combinatorics, 21 (4) (2014), paper P4.5, 11 pages;
[arXiv], [published]

D. Christofides, J. Hladky, A. Mathe: Hamilton cycles in dense vertextransitive graphs
Journal of Combinatorial Theory, series B, volume 109 (2014), p. 3472; [arXiv], [published]
extended abstract appeared in proceedings of Eurocomb 2011, Electronic Notes in Discrete Mathematics [link]

J. Cibulka, J. Hladky, M.A. LaCroix, D.G. Wagner: A combinatorial proof of Rayleigh monotonicity for graphs
Ars Combinatoria, volume 117 (2014), p. 333348; [arXiv]
a slightly different approach can be found in this manuscript

2013

H. Hatami, D. Kral, J. Hladky, S. Norine, A. Razborov: On the Number of Pentagons in TriangleFree Graphs
Journal of Combinatorial Theory, series A, 120 (3) (2013) 722732; [arXiv], [published]

P. Allen, J. Bottcher, J. Hladky, D. Piguet: Turannical hypergraphs
Random Structures and Algorithms, 42(1) (2013), 2958; [arXiv], [published]
One of the main conjectures of the paper was proven by Gugelmann, Person, Steger, and Thomas in their paper "A randomized version of Ramsey's theorem" [journal version].

J. Hladky, D. Kral, S. Norine: Rank of divisors on tropical curves
Journal of Combinatorial Theory, Series A; 120 (7) (2013) 15211538; [arXiv], [published]

2012

H. Hatami, D. Kral, J. Hladky, S. Norine, A. Razborov: Nonthreecolorable common graphs exist
Combinatorics, Probability and Computing 21 (2012) 734742; [arXiv],
[published]

C. Grosu, J. Hladky: The extremal function for partial bipartite tilings
European Journal of Combinatorics, 33 (5) (2012), 807815; [arXiv], [published]

J. Bottcher, J. Hladky, D. Piguet: The tripartite Ramsey number for trees
Journal of Graph Theory 69 (3) (2012), 264300; [arXiv], [published]
extended abstract appeared in proceedings of Eurocomb 2009, Electronic Notes in Discrete Mathematics; [link]

2011

P. Allen, J. Bottcher, J. Hladky: Filling the gap between Turan's theorem and Posa's conjecture
Journal of the London Mathematical Society 84(2) (2011), 269302; [arXiv], [published]
extended abstract coauthored by O. Cooley appeared in proceedings of Eurocomb 2009, Electronic Notes in Discrete Mathematics; [link]

2010

J. Hladky, D. Kral, U. Schauz: Brooks' Theorem via the AlonTarsi Theorem
Discrete Mathematics 310 (2010), 34263428; [arXiv], [published]

J. Hladky, M. Schacht: Note on bipartite graph tilings
SIAM Journal on Discrete Mathematics 24(2) (2010), 357362; [arXiv], [published]

2008

J. Hladky, D. Kral, J.S. Sereni, M. Stiebitz: List colorings with measurable sets
Journal of Graph Theory, 59 (3) (2008), p. 229238; [preprint], [published]

2006

J. Hladky, J. Novak, P. Pyrih, M. Sterzik, M. Tancer: An engine breaking the $\Omega EP$property
Topology and its Applications, 153 (2006), p. 36213626; [published]
