Search Results for ""

Combinatorial topology is a subset of algebraic topology that uses combinatorial methods. For example, simplicial homology is a combinatorial construction in algebraic ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

Combinatorial game theory is the theory of two-player games of perfect knowledge such as go, chess, or checkers.

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

A set of blocks, also called a resolution class, that partition the set V, where (V,B) is a balanced incomplete block design.

A balanced incomplete block design (B,V) is called resolvable if there exists a partition R of its set of blocks B into parallel classes, each of which in turn partitions the ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

Resolution is a widely used word with many different meanings. It can refer to resolution of equations, resolution of singularities (in algebraic geometry), resolution of ...