1 citations · 1 across the 1 of their papers we have counts for
4 papers
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth
Eva Fluck, Tim Seppelt, Gian Luca Spitzer
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment , using homomorphism indi…
A structural duality for path-decompositions into parts of small radius
Sandra Albrechtsen, Reinhard Diestel, Ann-Kathrin Elm +4
It is an easy observation that if a graph~ admits a path-decomposition whose parts have small radius, then contains no large subdivision of or as a (quasi-)g…
Tangles and Hierarchical Clustering
Eva Fluck
We establish a connection between tangles, a concept from structural graph theory that plays a central role in Robertson and Seymour's graph minor project, and hierarchical cluster…