Search Results for ""

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

The version of set theory obtained if Axiom 6 of Zermelo-Fraenkel set theory is replaced by 6'. Selection axiom (or "axiom of subsets"): for any set-theoretic formula A(u), ...

Discrete group theory is a broad subject covering certain aspects of groups. Such topics as free groups, group presentations, fundamental groups, Kleinian groups, and ...

Elementary number theory is the branch of number theory in which elementary methods (i.e., arithmetic, geometry, and high school algebra) are used to solve equations with ...

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

Algebraic number theory is the branch of number theory that deals with algebraic numbers. Historically, algebraic number theory developed as a set of tools for solving ...

A theory of Hamiltonian cycles.

The study of definable sets and functions in polish spaces.

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.