Search Results for ""

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

A theory of Hamiltonian cycles.

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The study of how the intrinsic structure of graphs ensures certain types of properties (e.g., clique-formation and graph colorings) under appropriate conditions.

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 ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

Hilbert-Schmidt theory is the study of linear integral equations of the Fredholm type with symmetric integral kernels K(x,t)=K(t,x).

Krohn-Rhodes theory is a mathematical approach that seeks to decompose finite semigroups in terms of finite aperiodic semigroups and finite groups.

The study of a finite group G using the local subgroups of G. Local group theory plays a critical role in the classification theorem of finite groups.

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...