Search Results for ""

Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

The abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...