Sentence examples for larger sets of hypergraphs from inspiring English sources

If on the one hand, this condition can appear too constraining, on the other hand it can be generalized to larger sets of hypergraphs.

Since vertex-transitive self-complementary uniform hypergraphs are equivalent to a certain kind of large sets of t-designs, the results of the paper imply the corresponding results in design theory.

In fact the bootstrap vertices b (H, S H ) constitute the largest set of vertices not reachable from the source and such that each element of the set belongs to the head of at least one reaction whose tail only contains vertices in B (H, S H ) or in b (H, S H ). Notice that the set of bootstrap vertices in a hypergraph H only depends on the source vertices and does not depend on the target.

This is the largest set of codes.

Since our definition is a way to complete the definition in [S1], then the two definitions agree on the set of hypergraphs employed for the reduction.

Notice that there are quite a lot of hypergraphs that are not proof nets.

This chapter discusses the properties of hypergraphs.

We show that hypergraphs can be extended to face-hypergraphs in a natural way and use tools from topological graph theory, the theory of hypergraphs, and design theory to obtain general bounds for the coloring and choosability problems.

Recently, the spectral radii of hypergraphs have been studied in [8, 9].

Then we give some examples to compare these bounds for Z-spectral radius of hypergraphs.

Another way of extending classical graph theory for active components is through the use of hypergraphs.