arXiv (All)
open access
Dichotomy results for classes of countable graphs
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural dichotomy for such classes: If $\mathcal{G}$ is not an induc
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
- The Zero Forcing Number of Graph Powers#1199166
- Induced subgraphs and tree decompositions XIX. Thetas and forests#927134
- Automated Termination Proving : contributions to Graph Rewriting via Extended Weighted Type Graphs and Morphism Counting#370840
- Recursive-Head Geometry and Order-Free Efficient Inference in Finite-State Nested Markov Models#1011651
- Automated Inference of Graph Transformation Rules#622689
Record · ID 1297010
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