Jan Hladký

According to our database, Jan Hladký authored at least 41 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Prominent examples of flip processes.

Pedro Araújo, Jan Hladký, Eng Keat Hng, Matas Sileikis

Random Struct. Algorithms, May, 2024

2023

Approximating fractionally isomorphic graphons.

Jan Hladký, Eng Keat Hng

Eur. J. Comb., October, 2023

2022

Cut distance identifying graphon parameters over weak* limits.

Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon

J. Comb. Theory A, 2022

Two Remarks on Graph Norms.

Frederik Garbe, Jan Hladký, Joonkyung Lee

Discret. Comput. Geom., 2022

2021

A limit theorem for small cliques in inhomogeneous random graphs.

Jan Hladký, Christos Pelekis, Matas Sileikis

J. Graph Theory, 2021

Relating the cut distance and the weak* topology for graphons.

Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon

J. Comb. Theory B, 2021

Tilings in graphons.

Jan Hladký, Ping Hu, Diana Piguet

Eur. J. Comb., 2021

A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems.

Martin Dolezal, Jan Hladký, Jan Kolár, Themis Mitsis, Christos Pelekis, Václav Vlasák

Discret. Comput. Geom., 2021

2020

Almost all trees are almost graceful.

Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký

Random Struct. Algorithms, July, 2020

Independent sets, cliques, and colorings in graphons.

Jan Hladký, Israel Rocha

Eur. J. Comb., 2020

2019

Komlós's tiling theorem via graphon covers.

Jan Hladký, Ping Hu, Diana Piguet

J. Graph Theory, 2019

Cut-norm and entropy minimization over weak^⁎ limits.

Martin Dolezal, Jan Hladký

J. Comb. Theory B, 2019

Matching Polytons.

Martin Dolezal, Jan Hladký

Electron. J. Comb., 2019

2017

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi

SIAM J. Discret. Math., 2017

Cliques in dense inhomogeneous random graphs.

Martin Dolezal, Jan Hladký, András Máthé

Random Struct. Algorithms, 2017

First steps in combinatorial optimization on graphons: Matchings.

Martin Dolezal, Jan Hladký, Ping Hu, Diana Piguet

Electron. Notes Discret. Math., 2017

Packing degenerate graphs greedily.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2017

Chromatic roots and limits of dense graphs.

Péter Csikvári, Péter E. Frenkel, Jan Hladký, Tamás Hubai

Discret. Math., 2017

2016

Loebl-Komlós-Sós Conjecture: Dense case.

Jan Hladký, Diana Piguet

J. Comb. Theory B, 2016

2014

Hamilton cycles in dense vertex-transitive graphs.

Demetres Christofides, Jan Hladký, András Máthé

J. Comb. Theory B, 2014

An Extension of Turán's Theorem, Uniqueness and Stability.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. J. Comb., 2014

A Combinatorial Proof Of Rayleigh Monotonicity For Graphs.

Josef Cibulka, Jan Hladký, Michael A. La Croix, David G. Wagner

Ars Comb., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.

Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz

Proceedings of the Approximation, 2014

2013

Turánnical hypergraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Random Struct. Algorithms, 2013

Rank of divisors on tropical curves.

Jan Hladký, Daniel Král', Serguei Norine

J. Comb. Theory A, 2013

On the number of pentagons in triangle-free graphs.

Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov

J. Comb. Theory A, 2013

2012

The tripartite Ramsey number for trees.

Julia Böttcher, Jan Hladký, Diana Piguet

J. Graph Theory, 2012

The extremal function for partial bipartite tilings.

Codrut Grosu, Jan Hladký

Eur. J. Comb., 2012

Non-Three-Colourable Common Graphs Exist.

Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov

Comb. Probab. Comput., 2012

2011

Filling the gap between Turán's theorem and Pósa's conjecture.

Peter Allen, Julia Böttcher, Jan Hladký

J. Lond. Math. Soc., 2011

A proof of the dense version of Lovász conjecture.

Demetres Christofides, Jan Hladký, András Máthé

Electron. Notes Discret. Math., 2011

A density Corrádi-Hajnal theorem.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2011

2010

Note on Bipartite Graph Tilings.

Jan Hladký, Mathias Schacht

SIAM J. Discret. Math., 2010

Brooks' Theorem via the Alon-Tarsi Theorem.

Jan Hladký, Daniel Král', Uwe Schauz

Discret. Math., 2010

2009

Counting flags in triangle-free digraphs.

Jan Hladký, Daniel Král, Sergey Norin

Electron. Notes Discret. Math., 2009

Loebl-Komlós-Sós Conjecture: dense case.

Oliver Cooley, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2009

Minimum degree conditions for large subgraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley

Electron. Notes Discret. Math., 2009

2008

List colorings with measurable sets.

Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz

J. Graph Theory, 2008