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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial theory. Series B Ročník 174; s. 133 - 189
Hlavní autori:	Joos, Felix, Kim, Jaehoon, Kühn, Daniela, Osthus, Deryk
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.09.2025
Predmet:	Hypergraphs Property testing Sublinear algorithms Hypergraphs Sublinear algorithms Property testing
ISSN:	0095-8956
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!