Approximating fractionally isomorphic graphons von Hladký, Jan, Hng, Eng Keat

Volltext

Independent sets, cliques, and colorings in graphons von Hladký, Jan, Rocha, Israel

Volltext

Two Remarks on Graph Norms von Garbe, Frederik, Hladký, Jan, Lee, Joonkyung

Volltext

The Local Limit of the Uniform Spanning Tree on Dense Graphs von Hladký, Jan, Nachmias, Asaf, Tran, Tuan

Volltext

On pattern‐avoiding permutons von Garbe, Frederik, Hladký, Jan, Kun, Gábor, Pekárková, Kristýna

Volltext

Tilings in graphons von Hladký, Jan, Hu, Ping, Piguet, Diana

Volltext

Assessment of phytotoxicity, environmental and health risks of historical urban park soils von Brtnický, Martin, Pecina, Václav, Hladký, Jan, Radziemska, Maja, Koudelková, Zuzana, Klimánek, Martin, Richtera, Lukáš, Adamcová, Dana, Elbl, Jakub, Galiová, Michaela Vašinová, Baláková, Ludmila, Kynický, Jindřich, Smolíková, Vendula, Houška, Jakub, Vaverková, Magdalena Daria

Volltext

Loebl–Komlós–Sós Conjecture: Dense case von Hladký, Jan, Piguet, Diana

Volltext

Prominent examples of flip processes von Araújo, Pedro, Hladký, Jan, Hng, Eng Keat, Šileikis, Matas

Volltext

Komlós's tiling theorem via graphon covers von Hladký, Jan, Hu, Ping, Piguet, Diana

Volltext

Cut-norm and entropy minimization over weak⁎ limits von Doležal, Martin, Hladký, Jan

Volltext

Matching Polytons von Doležal, Martin, Hladký, Jan

Volltext

Packing degenerate graphs von Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana

Volltext

Counting flags in triangle-free digraphs von Hladký, Jan, Král’, Daniel, Norin, Sergey

Volltext

Cliques in dense inhomogeneous random graphs von Dolezal, Martin, Hladky, Jan, Mathe, András

Volltext

Environmental risk assessment and consequences of municipal solid waste disposal von Vaverková, Magdalena Daria, Elbl, Jakub, Radziemska, Maja, Adamcová, Dana, Kintl, Antonín, Baláková, Ludmila, Bartoň, Stanislav, Hladký, Jan, Kynický, Jindřich, Brtnický, Martin

Volltext

Almost all trees are almost graceful von Adamaszek, Anna, Allen, Peter, Grosu, Codruţ, Hladký, Jan

Volltext

Cut distance identifying graphon parameters over weak limits von Doležal, Martin, Grebík, Jan, Hladký, Jan, Rocha, Israel, Rozhoň, Václav

Volltext

A limit theorem for small cliques in inhomogeneous random graphs von Hladký, Jan, Pelekis, Christos, Šileikis, Matas

Volltext

Poset limits can be totally ordered von Hladký, Jan, Máthé, András, Patel, Viresh, Pikhurko, Oleg

Volltext