Sledovat
Jan Hladky
Jan Hladky
Institute of Computer Science of the Czech Academy of Sciences
E-mailová adresa ověřena na: cs.cas.cz - Domovská stránka
Název
Citace
Citace
Rok
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
1592013
Counting flags in triangle-free digraphs
J Hladký, D Král’, S Norin
Combinatorica 37 (1), 49-76, 2017
782017
Non-three-colourable common graphs exist
H Hatami, J Hladký, S Norine, A Razborov
Combinatorics, Probability and Computing 21 (05), 734-742, 2012
732012
Rank of divisors on tropical curves
J Hladký, D Králʼ, S Norine
Journal of Combinatorial Theory, Series A 120 (7), 1521-1538, 2013
67*2013
Brooks’ theorem via the Alon–Tarsi theorem
J Hladký, D Král, U Schauz
Discrete Mathematics 310 (23), 3426-3428, 2010
462010
Loebl–Komlós–Sós conjecture: dense case
J Hladký, D Piguet
Journal of Combinatorial Theory, Series B 116, 123-190, 2016
412016
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
352016
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
322014
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
312014
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
292014
The approximate Loebl–Komlós–Sós Conjecture II: The rough structure of LKS graphs
J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
arXiv preprint arXiv:1408.3871, 0
29*
Packing degenerate graphs
P Allen, J Böttcher, J Hladký, D Piguet
Advances in Mathematics 354, 106739, 2019
232019
Cliques in dense inhomogeneous random graphs
M Doležal, J Hladký, A Máthé
Random Structures & Algorithms 51 (2), 275-314, 2017
222017
Poset limits can be totally ordered
J Hladký, A Máthé, V Patel, O Pikhurko
Transactions of the American Mathematical Society 367 (6), 4319-4337, 2015
222015
A density Corrádi–Hajnal theorem
P Allen, J Böttcher, J Hladký, D Piguet
Canadian Journal of Mathematics 67 (4), 721-758, 2015
202015
Independent sets, cliques, and colorings in graphons
J Hladký, I Rocha
European Journal of Combinatorics 88, 103108, 2020
192020
Almost all trees are almost graceful
A Adamaszek, P Allen, C Grosu, J Hladký
Random Structures & Algorithms 56 (4), 948-987, 2020
182020
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
172014
Hamilton cycles in dense vertex-transitive graphs
D Christofides, J Hladký, A Máthé
Journal of Combinatorial Theory, Series B 109, 34-72, 2014
162014
Note on bipartite graph tilings
J Hladký, M Schacht
SIAM Journal on Discrete Mathematics 24 (2), 357-362, 2010
142010
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20