Jan Hladký

From MaRDI portal
Person:256343

Available identifiers

zbMath Open hladky.janWikidataQ102390509 ScholiaQ102390509MaRDI QIDQ256343

List of research outcomes





PublicationDate of PublicationType
From flip processes to dynamical systems on graphons2025-01-15Paper
On pattern-avoiding permutons2024-11-20Paper
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems2024-10-18Paper
Theory of limits of sequences of Latin squares2024-10-18Paper
Prominent examples of flip processes2024-03-25Paper
Random minimum spanning tree and dense graph limits2023-10-18Paper
A limit theorem for small cliques in inhomogeneous random graphs2023-10-04Paper
Approximating fractionally isomorphic graphons2023-08-10Paper
Connectivity of inhomogeneous random graphs II2023-05-05Paper
Cut distance identifying graphon parameters over weak* limits2022-04-01Paper
Two remarks on graph norms2022-03-22Paper
From flip processes to dynamical systems on graphons2022-01-28Paper
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems2021-07-02Paper
The tree packing conjecture for trees of almost linear maximum degree2021-06-22Paper
Tilings in graphons2021-02-08Paper
Relating the cut distance and the weak* topology for graphons2021-02-03Paper
Limits of Latin squares2020-10-15Paper
Independent sets, cliques, and colorings in graphons2020-06-16Paper
Matching polytons2019-12-09Paper
Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits2019-07-17Paper
Komlós's tiling theorem via graphon covers2019-06-14Paper
Cut distance identifying graphon parameters over weak* limits2018-09-11Paper
Counting flags in triangle-free digraphs2018-03-16Paper
First steps in combinatorial optimization on graphons: matchings2018-01-18Paper
Cliques in dense inhomogeneous random graphs2017-09-18Paper
The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition2017-06-14Paper
The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs2017-06-14Paper
The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs2017-06-14Paper
The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result2017-06-14Paper
An Approximate Version of the Tree Packing Conjecture via Random Embeddings2017-03-22Paper
Chromatic roots and limits of dense graphs2017-02-27Paper
Upper bound theorem for odd-dimensional flag triangulations of manifolds2016-10-21Paper
An approximate version of the tree packing conjecture2016-04-21Paper
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs2016-03-09Paper
A combinatorial proof of Rayleigh monotonicity for graphs2016-01-14Paper
Loebl-Komlós-Sós conjecture: dense case2015-12-11Paper
Rank of divisors on tropical curves2015-06-19Paper
Poset limits can be totally ordered2015-04-22Paper
Dense flag triangulations of 3-manifolds via extremal graph theory2015-02-02Paper
An extension of Turán's theorem, uniqueness and stability2014-10-23Paper
Hamilton cycles in dense vertex-transitive graphs2014-10-22Paper
A proof of the dense version of Lovász conjecture2013-11-01Paper
A density Corrádi-Hajnal theorem2013-11-01Paper
Counting flags in triangle-free digraphs2013-10-10Paper
The tripartite Ramsey number for trees2013-10-10Paper
Loebl-Komlós-Sós conjecture: dense case2013-10-10Paper
Minimum degree conditions for large subgraphs2013-10-10Paper
On the number of pentagons in triangle-free graphs2013-03-06Paper
The approximate Loebl-Koml\'os-S\'os Conjecture2012-11-13Paper
Non-three-colourable common graphs exist2012-09-12Paper
The tripartite Ramsey number for trees2012-06-13Paper
The extremal function for partial bipartite tilings2012-05-04Paper
Note on bipartite graph tilings2011-04-15Paper
Brooks' theorem via the Alon-Tarsi theorem2010-10-28Paper
List colorings with measurable sets2009-02-20Paper
Elementary proof of Rayleigh formula for graphs2008-03-31Paper
An engine breaking the \(\Omega\)EP-property2007-01-09Paper
On pattern-avoiding permutonsN/APaper

Research outcomes over time

This page was built for person: Jan Hladký