Search Results for ""

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

A generalization of simple majority voting in which a list of quotas {q_0,...,q_n} specifies, according to the number of votes, how many votes an alternative needs to win ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

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

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

There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

A simplicial complex is a space with a triangulation. Formally, a simplicial complex K in R^n is a collection of simplices in R^n such that 1. Every face of a simplex of K is ...