Abstract In practice, noise exists in the process of data collection and hypergraph construction. Therefore, missing, abundant, noisy connections may be introduced into generated structure, which lead to inaccurate inference on hypergraph. Another issue comes from increasing stream, is also very common many applications. It important consider structure evolution methods hypergraph, optimize acc...

A d-uniform hypergraph H is a sum hypergraph iff there is a finite S ⊆ IN such that H is isomorphic to the hypergraph H+d (S) = (V, E), where V = S and E = {{v1, . . . , vd} : (i 6= j ⇒ vi 6= vj)∧ ∑d i=1 vi ∈ S}. For an arbitrary d-uniform hypergraph H the sum number σ = σ(H) is defined to be the minimum number of isolated vertices w1, . . . , wσ 6∈ V such that H ∪ {w1, . . . , wσ} is a sum hyp...

The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. This hypergraph is not 2-colorable, but becomes so on deleting any hyperedge from it. We show that taking uniformly at random a labeled 3-uniform hypergraph H on n vertices not containing the hypergraph of the Fano plane, H turns out t...

The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various fields of Computer Science. We present and experimentally evaluate a heuristic algorithm for the problem, which seems able to handle large insta...