We give an infinitary extension of the Nešetřil-Rödl theorem for
categor...
This is an exposition of the contributions of László Lovász to
mathemati...
Nešetřil and Ossona de Mendez recently proposed a new definition of
grap...
Let 𝒞 be a hereditary class of graphs. Assume that for every p
there is ...
Logical transductions provide a very useful tool to encode classes of
st...
A partial order is universal if it contains every countable partial orde...
Using the Carlson-Simpson theorem, we give a new general condition for a...
Inspired by a width invariant defined on permutations by Guillemot and M...
Logical transductions provide a very useful tool to encode classes of
st...
We study two notions of being well-structured for classes of graphs that...
Szemeredi's Regularity Lemma is a very useful tool of extremal combinato...
We prove that if G is a sparse graph — it belongs to a fixed class of
bo...
Classes with bounded rankwidth are MSO-transductions of trees and classe...
Classes with bounded rankwidth are MSO-transductions of trees and classe...
We show the density theorem for the class of finite oriented trees order...
In this paper we prove a general theorem showing the extension property ...
We prove that the class of two-graphs has the extension property for par...
The notion of bounded expansion captures uniform sparsity of graph class...
We present a short and self-contained proof of the extension property fo...
We study automorphism groups of sparse graphs from the viewpoint of
topo...
We give Ramsey expansions of classes of generalised metric spaces where
...