IRIS
metadata only
Counting Subgraphs in Somewhere Dense Graphs
We study the problems of counting copies and induced copies of a small pattern graph in a large host graph . Recent work fully classified the complexity of those problems according to structural restrictions on the patterns . In this work, we address the more challenging task of analyzing the comple
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
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Locating-dominating partitions for some classes of graphs#147107
- Fundamentals of domination in graphs#1179875
- Domination in graphs#1332110
- Sparsification Framework for Directed Densest Subgraph#1155781
Record · ID 1470217
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