Search Results for ""

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

The nullity of a linear transformation f:V->W of vector spaces is the dimension of its null space. The nullity and the map rank add up to the dimension of V, a result ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

Rubik's Clock is a puzzle consisting of 18 small clocks, 14 of which are independent, each of which may be set to any 12-hour position. There are therefore 12^(14) possible ...

A lattice polygon consisting of a closed self-avoiding walk on a square lattice. The perimeter, horizontal perimeter, vertical perimeter, and area are all well-defined for ...

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

A framework is called "just rigid" if it is rigid, but ceases to be so when any single bar is removed. Lamb (1928, pp. 93-94) proved that a necessary (but not sufficient) ...