Search Results for ""

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

The Nevanlinna Prize is awarded by the International Mathematical Union to outstanding contributors to the mathematical aspects of information science. The International ...

The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...

The first theorem of Pappus states that the surface area S of a surface of revolution generated by the revolution of a curve about an external axis is equal to the product of ...

A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...

Reciprocation is an incidence-preserving transformation in which points are transformed into their polars. A projective geometry-like duality principle holds for ...