Artikelen met mandaten voor openbare toegang - Jan HladkyMeer informatie
Ergens beschikbaar: 31
On the number of pentagons in triangle-free graphs
H Hatami, J Hladký, D Králʼ, S Norine, A Razborov
Journal of Combinatorial Theory, Series A 120 (3), 722-732, 2013
Mandaten: UK Engineering and Physical Sciences Research Council
Counting flags in triangle-free digraphs
J Hladký, D Král’, S Norin
Combinatorica 37 (1), 49-76, 2017
Mandaten: US National Science Foundation, Natural Sciences and Engineering Research …
Loebl–Komlós–Sós conjecture: dense case
J Hladký, D Piguet
Journal of Combinatorial Theory, Series B 116, 123-190, 2016
Mandaten: Magyar Tudományos Akadémia
An approximate version of the tree packing conjecture
J Böttcher, J Hladký, D Piguet, A Taraz
Israel journal of mathematics 211 (1), 391-446, 2016
Mandaten: German Research Foundation, UK Engineering and Physical Sciences Research …
The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition
J Hladký, J Komlós, D Piguet, M Simonovits, MJ Stein, E Szemerédi
arXiv preprint arXiv:1408.3858, 2014
Mandaten: German Research Foundation, Magyar Tudományos Akadémia, Hungarian Scientific …
The approximate Loebl–Komlós–Sós Conjecture IV: Embedding techniques and the proof of the main result
J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
arXiv preprint arXiv:1408.3870, 2014
Mandaten: German Research Foundation, Magyar Tudományos Akadémia, Hungarian Scientific …
The approximate Loebl–Komlós–Sós Conjecture III: The finer structure of LKS graphs
J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
arXiv preprint arXiv:1408.3866, 2014
Mandaten: German Research Foundation, Magyar Tudományos Akadémia, Hungarian Scientific …
Packing degenerate graphs
P Allen, J Böttcher, J Hladký, D Piguet
Advances in Mathematics 354, 106739, 2019
Mandaten: UK Engineering and Physical Sciences Research Council
A density Corrádi–Hajnal theorem
P Allen, J Böttcher, J Hladký, D Piguet
Canadian Journal of Mathematics 67 (4), 721-758, 2015
Mandaten: UK Engineering and Physical Sciences Research Council
Poset limits can be totally ordered
J Hladký, A Máthé, V Patel, O Pikhurko
Transactions of the American Mathematical Society, 4319-4337, 2015
Mandaten: UK Engineering and Physical Sciences Research Council, European Commission
Cliques in dense inhomogeneous random graphs
M Doležal, J Hladký, A Máthé
Random Structures & Algorithms 51 (2), 275-314, 2017
Mandaten: National Office for Research, Development and Innovation, Hungary
Almost all trees are almost graceful
A Adamaszek, P Allen, C Grosu, J Hladký
Random Structures & Algorithms 56 (4), 948-987, 2020
Mandaten: German Research Foundation, European Commission
Hamilton cycles in dense vertex-transitive graphs
D Christofides, J Hladký, A Máthé
Journal of Combinatorial Theory, Series B 109, 34-72, 2014
Mandaten: UK Engineering and Physical Sciences Research Council
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
J Hladky, D Piguet, M Simonovits, M Stein, E Szemeredi
arXiv preprint arXiv:1406.3935, 2014
Mandaten: German Research Foundation, UK Engineering and Physical Sciences Research …
Note on bipartite graph tilings
J Hladký, M Schacht
SIAM Journal on Discrete Mathematics 24 (2), 357-362, 2010
Mandaten: German Research Foundation
Komlós's tiling theorem via graphon covers
J Hladký, P Hu, D Piguet
Journal of Graph Theory 90 (1), 24-45, 2019
Mandaten: European Commission
The local limit of the uniform spanning tree on dense graphs
J Hladký, A Nachmias, T Tran
Journal of Statistical Physics 173, 502-545, 2018
Mandaten: European Commission
Filling the gap between Turán's theorem and Pósa's conjecture
P Allen, J Böttcher, J Hladký
Journal of the London Mathematical Society 84 (2), 269-302, 2011
Mandaten: German Research Foundation
Tilings in graphons
J Hladký, P Hu, D Piguet
European Journal of Combinatorics 93, 103284, 2021
Mandaten: European Commission
Upper bound theorem for odd-dimensional flag triangulations of manifolds
M Adamaszek, J Hladký
Mathematika 62 (3), 909-928, 2016
Mandaten: Villum Foundation
Publicatie- en financieringsgegevens worden automatisch vastgesteld door een computerprogramma