Search Results for ""

A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.

A word or string which is not admissible.

The number of inward directed graph edges from a given graph vertex in a directed graph.

A theory of Hamiltonian cycles.

A 5-polyabolo.

One of the four 5-polyiamonds are called pentiamonds.

A sum over all cluster perimeters.

A heptomino in the shape of the Greek character pi.

5((x^5)_infty^5)/((x)_infty^6)=sum_(m=0)^inftyP(5m+4)x^m, where (x)_infty is a q-Pochhammer symbol and P(n) is the partition function P.

A refinement X of a cover Y is a cover such that every element x in X is a subset of an element y in Y.