Jan Hladký

According to our database1, Jan Hladký authored at least 32 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Independent sets, cliques, and colorings in graphons.
Eur. J. Comb., 2020

2019
Komlós's tiling theorem via graphon covers.
J. Graph Theory, 2019

Cut-norm and entropy minimization over weak<sup>⁎</sup> limits.
J. Comb. Theory, Ser. B, 2019

Matching Polytons.
Electron. J. Comb., 2019

2017
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discret. Math., 2017

Cliques in dense inhomogeneous random graphs.
Random Struct. Algorithms, 2017

First steps in combinatorial optimization on graphons: Matchings.
Electron. Notes Discret. Math., 2017

Packing degenerate graphs greedily.
Electron. Notes Discret. Math., 2017

Chromatic roots and limits of dense graphs.
Discret. Math., 2017

2016
Loebl-Komlós-Sós Conjecture: Dense case.
J. Comb. Theory, Ser. B, 2016

2014
Hamilton cycles in dense vertex-transitive graphs.
J. Comb. Theory, Ser. B, 2014

An Extension of Turán's Theorem, Uniqueness and Stability.
Electron. J. Comb., 2014

A Combinatorial Proof Of Rayleigh Monotonicity For Graphs.
Ars Comb., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
Proceedings of the Approximation, 2014

2013
Turánnical hypergraphs.
Random Struct. Algorithms, 2013

Rank of divisors on tropical curves.
J. Comb. Theory, Ser. A, 2013

On the number of pentagons in triangle-free graphs.
J. Comb. Theory, Ser. A, 2013

2012
The extremal function for partial bipartite tilings.
Eur. J. Comb., 2012

Non-Three-Colourable Common Graphs Exist.
Comb. Probab. Comput., 2012

2011
Filling the gap between Turán's theorem and Pósa's conjecture.
J. Lond. Math. Soc., 2011

A proof of the dense version of Lovász conjecture.
Electron. Notes Discret. Math., 2011

A density Corrádi-Hajnal theorem.
Electron. Notes Discret. Math., 2011

2010
Note on Bipartite Graph Tilings.
SIAM J. Discret. Math., 2010

Brooks' Theorem via the Alon-Tarsi Theorem.
Discret. Math., 2010

2009
Counting flags in triangle-free digraphs.
Electron. Notes Discret. Math., 2009

Loebl-Komlós-Sós Conjecture: dense case.
Electron. Notes Discret. Math., 2009

The tripartite Ramsey number for trees.
Electron. Notes Discret. Math., 2009

Minimum degree conditions for large subgraphs.
Electron. Notes Discret. Math., 2009

2008
List colorings with measurable sets.
J. Graph Theory, 2008


  Loading...