Search Results for ""

There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...

The apeirogon is an extension of the definition of regular polygon to a figure with an infinite number of sides. Its Schläfli symbol is {infty}. The apeirogon can produce a ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...