default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Hladký
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Pedro Araújo, Jan Hladký
, Eng Keat Hng, Matas Sileikis:
Prominent examples of flip processes. Random Struct. Algorithms 64(3): 692-740 (2024)- 2023
- [j41]Jan Hladký, Eng Keat Hng:
Approximating fractionally isomorphic graphons. Eur. J. Comb. 113: 103751 (2023) - 2022
- [j40]Frederik Garbe, Jan Hladký, Joonkyung Lee:
Two Remarks on Graph Norms. Discret. Comput. Geom. 67(3): 919-929 (2022) - [j39]Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon:
Cut distance identifying graphon parameters over weak* limits. J. Comb. Theory A 189: 105615 (2022) - 2021
- [j38]Martin Dolezal, Jan Hladký, Jan Kolár, Themis Mitsis, Christos Pelekis, Václav Vlasák:
A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems. Discret. Comput. Geom. 66(1): 281-300 (2021) - [j37]Jan Hladký, Ping Hu, Diana Piguet:
Tilings in graphons. Eur. J. Comb. 93: 103284 (2021) - [j36]Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon:
Relating the cut distance and the weak* topology for graphons. J. Comb. Theory B 147: 252-298 (2021) - [j35]Jan Hladký, Christos Pelekis, Matas Sileikis:
A limit theorem for small cliques in inhomogeneous random graphs. J. Graph Theory 97(4): 578-599 (2021) - 2020
- [j34]Jan Hladký, Israel Rocha:
Independent sets, cliques, and colorings in graphons. Eur. J. Comb. 88: 103108 (2020) - [j33]Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký:
Almost all trees are almost graceful. Random Struct. Algorithms 56(4): 948-987 (2020)
2010 – 2019
- 2019
- [j32]Martin Dolezal, Jan Hladký:
Matching Polytons. Electron. J. Comb. 26(4): 4 (2019) - [j31]Martin Dolezal, Jan Hladký:
Cut-norm and entropy minimization over weak⁎ limits. J. Comb. Theory B 137: 232-263 (2019) - [j30]Jan Hladký, Ping Hu, Diana Piguet:
Komlós's tiling theorem via graphon covers. J. Graph Theory 90(1): 24-45 (2019) - 2017
- [j29]Jan Hladký, Daniel Král', Sergey Norin:
Counting flags in triangle-free digraphs. Comb. 37(1): 49-76 (2017) - [j28]Péter Csikvári, Péter E. Frenkel, Jan Hladký, Tamás Hubai:
Chromatic roots and limits of dense graphs. Discret. Math. 340(5): 1129-1135 (2017) - [j27]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
Packing degenerate graphs greedily. Electron. Notes Discret. Math. 61: 45-51 (2017) - [j26]Martin Dolezal, Jan Hladký, Ping Hu, Diana Piguet:
First steps in combinatorial optimization on graphons: Matchings. Electron. Notes Discret. Math. 61: 359-365 (2017) - [j25]Martin Dolezal, Jan Hladký, András Máthé:
Cliques in dense inhomogeneous random graphs. Random Struct. Algorithms 51(2): 275-314 (2017) - [j24]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31(2): 945-982 (2017) - [j23]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 983-1016 (2017) - [j22]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 1017-1071 (2017) - [j21]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31(2): 1072-1148 (2017) - 2016
- [j20]Jan Hladký, Diana Piguet:
Loebl-Komlós-Sós Conjecture: Dense case. J. Comb. Theory B 116: 123-190 (2016) - 2014
- [j19]Josef Cibulka, Jan Hladký, Michael A. La Croix, David G. Wagner:
A Combinatorial Proof Of Rayleigh Monotonicity For Graphs. Ars Comb. 117: 333-348 (2014) - [j18]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
An Extension of Turán's Theorem, Uniqueness and Stability. Electron. J. Comb. 21(4): 4 (2014) - [j17]Demetres Christofides, Jan Hladký, András Máthé:
Hamilton cycles in dense vertex-transitive graphs. J. Comb. Theory B 109: 34-72 (2014) - [c1]Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz:
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM 2014: 490-499 - 2013
- [j16]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
On the number of pentagons in triangle-free graphs. J. Comb. Theory A 120(3): 722-732 (2013) - [j15]Jan Hladký, Daniel Král', Serguei Norine:
Rank of divisors on tropical curves. J. Comb. Theory A 120(7): 1521-1538 (2013) - [j14]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
Turánnical hypergraphs. Random Struct. Algorithms 42(1): 29-58 (2013) - 2012
- [j13]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21(5): 734-742 (2012) - [j12]Codrut Grosu, Jan Hladký:
The extremal function for partial bipartite tilings. Eur. J. Comb. 33(5): 807-815 (2012) - [j11]Julia Böttcher, Jan Hladký, Diana Piguet:
The tripartite Ramsey number for trees. J. Graph Theory 69(3): 264-300 (2012) - 2011
- [j10]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
A density Corrádi-Hajnal theorem. Electron. Notes Discret. Math. 38: 31-36 (2011) - [j9]Demetres Christofides, Jan Hladký, András Máthé:
A proof of the dense version of Lovász conjecture. Electron. Notes Discret. Math. 38: 285-290 (2011) - [j8]Peter Allen, Julia Böttcher, Jan Hladký:
Filling the gap between Turán's theorem and Pósa's conjecture. J. Lond. Math. Soc. 84(2): 269-302 (2011) - 2010
- [j7]Jan Hladký, Daniel Král', Uwe Schauz:
Brooks' Theorem via the Alon-Tarsi Theorem. Discret. Math. 310(23): 3426-3428 (2010) - [j6]Jan Hladký, Mathias Schacht:
Note on Bipartite Graph Tilings. SIAM J. Discret. Math. 24(2): 357-362 (2010)
2000 – 2009
- 2009
- [j5]Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley:
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34: 75-79 (2009) - [j4]Julia Böttcher, Jan Hladký, Diana Piguet:
The tripartite Ramsey number for trees. Electron. Notes Discret. Math. 34: 597-601 (2009) - [j3]Oliver Cooley, Jan Hladký, Diana Piguet:
Loebl-Komlós-Sós Conjecture: dense case. Electron. Notes Discret. Math. 34: 609-613 (2009) - [j2]Jan Hladký, Daniel Král, Sergey Norin:
Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. 34: 621-625 (2009) - 2008
- [j1]Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
List colorings with measurable sets. J. Graph Theory 59(3): 229-238 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
