arXiv (All)
open access
Tolerant Testers for Subgraph-Freeness
In this paper we study the problem of tolerantly testing the property of being $H$-free (which also implies distance approximation from being $H$-free). In the general-graphs model, we show that tolerant $K_k$-freeness testing can be achieved with query complexity that is polynomial in the arboricit
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
- Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle#1144623
- The least signless Laplacian eigenvalue of $\{C_3,C_5\}$-free graphs#1155810
- Arboricity Matters in Triangle Counting with Random Edges#1328274
- Identifying codes in triangle-free graphs of bounded maximum degree#1187198
- Introvert Clustering for Distributed Graph Algorithms#673484
Record · ID 1355802
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