42 citations · 100 across the 5 of their papers we have counts for
5 papers · 1 filter
Defective colouring of graphs excluding a subgraph or minor
Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
Archdeacon (1987) proved that graphs embeddable on a fixed surface can be -coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, O…
Existence of Modeling Limits for Sequences of Sparse Structures
J. Nesetril, P. Ossona de Mendez
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability…
On Low Tree-Depth Decompositions
Jaroslav Nesetril, Patrice Ossona De Mendez
The theory of sparse structures usually uses tree like structures as building blocks. In the context of sparse/dense dichotomy this role is played by graphs with bounded tree depth…
A note on circular chromatic number of graphs with large girth and similar problems
Jaroslav Nesetril, Patrice Ossona De Mendez
In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar res…
A unified approach to structural limits, and limits of graphs with bounded tree-depth
Jaroslav Nesetril, Patrice Ossona De Mendez
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory…