In this article we give a polynomial algorithm to recognize if any partial sub hypergraph of a hypergraph has the Helly property

We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,

We introduce the notion of Hypergraph Weighted Model (HWM) that generically associates a tensor network to a hypergraph and then computes a value by tensor contractions directed by its hyperedges. A series r defined on a hypergraph family is said to be recognizable if there exists a HWM that computes it. This model generalizes the notion of rational series on strings and trees. We prove some pr...

The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality measurement for a graph. We’ll use this measurement to say more about the number of communications in a hypergraph, to implement a learning mechanism, and to con...

Let k be a positive integer. A hypergraphH is k-partition-connected if for every partition P of V (H), there are at least k(|P |−1) hyperedges intersecting at least two classes of P . In this paper, we determine the minimum number of hyperedges in a hypergraph whose addition makes the resulting hypergraph k-partition-connected. We also characterize the hyperedges of a k-partition-connected hype...

In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less than the average degree in the hypergraph, with equality only if the hypergraph is regular. Here, we prove a wider class of inequalities in a ...

We prove a removal lemma for infinitely-many forbidden hypergraphs. It affirmatively settles a question on property testing raised by Alon and Shapira (2005) [2, 3]. All monotone hypergraph properties and all hereditary partite hypergraph properties are testable. Our proof constructs a constant-time probabilistic algorithm to edit a small number of edges. It also gives a quantitative bound in t...

Given a set of propositions, one can consider its inconsistency hypergraph. Then the safisfiability of sets of clauses with respect to that hypergraph (see [2], [4]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...