arXiv (All)
open access
Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
We introduce baggy elimination trees, a novel graph decomposition that generalises the classical elimination trees underlying treedepth, and use them to give a complete characterisation of the monotone bounded-depth formula complexity of graph homomorphism and coloured isomorphism polynomials. Speci
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
- GGS-groups acting on trees of growing degrees#609742
- State-Separation and Hybrid Argument for Circuit Lower Bounds: A Structural Approach Toward P̸=NP#101306
- Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$#1115714
- Nonamenable subforests of multi-ended quasi-pmp graphs#684143
- Nonamenable subforests of multi-ended quasi-pmp graphs#682368
Record · ID 1129135
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