1 paper · 1 filter
Dániel Szabó, Simon Apers
We show that the graph property of having a (very) large k-th Betti number I^k2 for constant k is testable with a constant number of queries in the dense graph model. More sp…