A characterization of testable hypergraph properties
We provide a combinatorial characterization of all testable properties of k-uniform hypergraphs (k-graphs for short). Here, a k-graph property P is testable if there is a randomized algorithm which makes a bounded number of edge queries and distinguishes with probability 2/3 between k-graphs that sa...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
6 May 2025
|
| In: |
Journal of combinatorial theory
Year: 2025, Volume: 174, Pages: 133-189 |
| DOI: | 10.1016/j.jctb.2025.04.009 |
| Online Access: | Verlag, kostenfrei, Volltext: https://doi.org/10.1016/j.jctb.2025.04.009 Verlag, kostenfrei, Volltext: https://www.sciencedirect.com/science/article/pii/S0095895625000292 
|
| Author Notes: | Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus |
Search Result 1
A characterization of testable hypergraph properties
Article (Journal)
Chapter/Article
Online Resource