1 citations · 1 across the 2 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
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…
math.CO2023
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…