Search Results for ""

A finite sequence of n letters from some alphabet is said to be an n-ary word.

The Wormald graph is a unit-distance 4-chromatic graph with girth 5 on 13+5(13; 5)=6448 vertices.

The Yiu circle is the circumcircle of the Yiu triangle DeltaO_AO_BO_C. It has center function given by alpha=af(a,b,c), where f(a,b,c) is a 14th-order polynomial. Its radius ...

F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

The Archimedean solids in general have many stellations. Examples of Archimedean solid stellations include the dodecadodecahedron and great icosidodecahedron. The following ...

A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...

Consider the sequence defined by w_1=01 and w_(n+1)=w_nw_nw_n^R, where l^R denotes the reverse of a sequence l. The first few terms are then 01, 010110, 010110010110011010, ...

The Akhmim wooden tablet, often called the Cairo wooden tablet, is a document dating to 2000 BC, near the beginning of the Egyptian Middle Kingdom. It is housed in the Egypt ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...