Conceptio › Archive › arXiv (OAI)
arXiv (OAI)open access

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth

Adler, Isolde et al. · 2025
arXiv (OAI) · Papers · License: Open Access · 2025
Open Source ↗Direct PDF ↓
logic in computer science, discrete mathematics, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 173285
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.