Jan Hladký

46 papers Journal 45Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A tower lower bound for the degree relaxation of the Regularity Lemma.
Comb. Theory
Frederik Garbe, Jan Hladký
2026 J jnl
On Cospectral Graphons.
Electron. J. Comb.
Jan Hladký, Daniel Ilkovic, Jared León, Xichao Shu
2024 J jnl
On pattern-avoiding permutons.
Random Struct. Algorithms
Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková
2024 J jnl
Prominent examples of flip processes.
Random Struct. Algorithms
Pedro Araújo, Jan Hladký, Eng Keat Hng, Matas Sileikis
2023 J jnl
Approximating fractionally isomorphic graphons.
Eur. J. Comb.
Jan Hladký, Eng Keat Hng
2022 J jnl
Cut distance identifying graphon parameters over weak* limits.
J. Comb. Theory A
Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon
2022 J jnl
Two Remarks on Graph Norms.
Discret. Comput. Geom.
Frederik Garbe, Jan Hladký, Joonkyung Lee
2021 J jnl
A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems.
Discret. Comput. Geom.
Martin Dolezal, Jan Hladký, Jan Kolár, Themis Mitsis, Christos Pelekis, Václav Vlasák
2021 J jnl
A limit theorem for small cliques in inhomogeneous random graphs.
J. Graph Theory
Jan Hladký, Christos Pelekis, Matas Sileikis
2021 J jnl
Relating the cut distance and the weak* topology for graphons.
J. Comb. Theory B
Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon
2021 J jnl
Tilings in graphons.
Eur. J. Comb.
Jan Hladký, Ping Hu, Diana Piguet
2020 J jnl
Almost all trees are almost graceful.
Random Struct. Algorithms
Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
2020 J jnl
Independent sets, cliques, and colorings in graphons.
Eur. J. Comb.
Jan Hladký, Israel Rocha
2019 J jnl
Cut-norm and entropy minimization over weak
J. Comb. Theory B
Martin Dolezal, Jan Hladký
2019 J jnl
Komlós's tiling theorem via graphon covers.
J. Graph Theory
Jan Hladký, Ping Hu, Diana Piguet
2019 J jnl
Matching Polytons.
Electron. J. Comb.
Martin Dolezal, Jan Hladký
2017 J jnl
Chromatic roots and limits of dense graphs.
Discret. Math.
Péter Csikvári, Péter E. Frenkel, Jan Hladký, Tamás Hubai
2017 J jnl
Cliques in dense inhomogeneous random graphs.
Random Struct. Algorithms
Martin Dolezal, Jan Hladký, András Máthé
2017 J jnl
Counting flags in triangle-free digraphs.
Comb.
Jan Hladký, Daniel Král', Sergey Norin
2017 J jnl
First steps in combinatorial optimization on graphons: Matchings.
Electron. Notes Discret. Math.
Martin Dolezal, Jan Hladký, Ping Hu, Diana Piguet
2017 J jnl
Packing degenerate graphs greedily.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2017 J jnl
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discret. Math.
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017 J jnl
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discret. Math.
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017 J jnl
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discret. Math.
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017 J jnl
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discret. Math.
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2016 J jnl
Loebl-Komlós-Sós Conjecture: Dense case.
J. Comb. Theory B
Jan Hladký, Diana Piguet
2014 J jnl
A Combinatorial Proof Of Rayleigh Monotonicity For Graphs.
Ars Comb.
Josef Cibulka, Jan Hladký, Michael A. La Croix, David G. Wagner
2014 — conf
An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
APPROX-RANDOM
Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz
2014 J jnl
An Extension of Turán's Theorem, Uniqueness and Stability.
Electron. J. Comb.
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2014 J jnl
Hamilton cycles in dense vertex-transitive graphs.
J. Comb. Theory B
Demetres Christofides, Jan Hladký, András Máthé
2013 J jnl
On the number of pentagons in triangle-free graphs.
J. Comb. Theory A
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
2013 J jnl
Rank of divisors on tropical curves.
J. Comb. Theory A
Jan Hladký, Daniel Král', Serguei Norine
2013 J jnl
Turánnical hypergraphs.
Random Struct. Algorithms
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2012 J jnl
Non-Three-Colourable Common Graphs Exist.
Comb. Probab. Comput.
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
2012 J jnl
The extremal function for partial bipartite tilings.
Eur. J. Comb.
Codrut Grosu, Jan Hladký
2012 J jnl
The tripartite Ramsey number for trees.
J. Graph Theory
Julia Böttcher, Jan Hladký, Diana Piguet
2011 J jnl
A density Corrádi-Hajnal theorem.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2011 J jnl
A proof of the dense version of Lovász conjecture.
Electron. Notes Discret. Math.
Demetres Christofides, Jan Hladký, András Máthé
2011 J jnl
Filling the gap between Turán's theorem and Pósa's conjecture.
J. Lond. Math. Soc.
Peter Allen, Julia Böttcher, Jan Hladký
2010 J jnl
Brooks' Theorem via the Alon-Tarsi Theorem.
Discret. Math.
Jan Hladký, Daniel Král', Uwe Schauz
2010 J jnl
Note on Bipartite Graph Tilings.
SIAM J. Discret. Math.
Jan Hladký, Mathias Schacht
2009 J jnl
Counting flags in triangle-free digraphs.
Electron. Notes Discret. Math.
Jan Hladký, Daniel Král, Sergey Norin
2009 J jnl
Loebl-Komlós-Sós Conjecture: dense case.
Electron. Notes Discret. Math.
Oliver Cooley, Jan Hladký, Diana Piguet
2009 J jnl
Minimum degree conditions for large subgraphs.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley
2009 J jnl
The tripartite Ramsey number for trees.
Electron. Notes Discret. Math.
Julia Böttcher, Jan Hladký, Diana Piguet
2008 J jnl
List colorings with measurable sets.
J. Graph Theory
Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz