Search Results for ""

A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...

Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...

Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...

A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...

Let H be a complex Hilbert space, and define a nest as a set N of closed subspaces of H satisfying the conditions: 1. 0,H in N, 2. If N_1,N_2 in N, then either N_1 subset= ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...