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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial theory. Series B Vol. 174; pp. 133 - 189
Main Authors:	Joos, Felix, Kim, Jaehoon, Kühn, Daniela, Osthus, Deryk
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2025
Subjects:	Hypergraphs Property testing Sublinear algorithms Hypergraphs Sublinear algorithms Property testing
ISSN:	0095-8956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!