arXiv (OAI)
open access
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Types of well-founded trees and the homomorphism order#1049938
- Exact Counts of Binary Phylogenetic Networks with Four Reticulations#1036162
- Ordered trees with distinguished children#614936
- Ordered trees with distinguished children#613969
- Depicting the tree of life: The philosophical and historical roots of evolutionary tree diagrams.#80854
Record · ID 173285
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive