nonisomorphic
Look at other dictionaries:
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Saharon Shelah — (hebräisch שהרן שלח; * 3. Juli 1945 in Jerusalem) ist ein israelischer Mathematiker. Er ist Professor an der Hebräischen Universität in Jerusalem sowie an der Rutgers University in New Jersey, USA. Shelah arbeitet auf dem Gebiet der… … Deutsch Wikipedia
Commutator subgroup — In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group.[1][2] The commutator subgroup is important because it is the smallest… … Wikipedia
Girth (graph theory) — In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph.[1] If the graph does not contain any cycles (i.e. it s an acyclic graph), its girth is defined to be infinity.[2] For example, a 4 cycle (square) has… … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Morley's categoricity theorem — Vaught s test redirects here. Not to be confused with the Tarski–Vaught test. Categorical theory redirects here. Not to be confused with Category Theory. In model theory, a branch of mathematical logic, a theory is κ categorical (or categorical… … Wikipedia
PCF theory — is the name of a mathematical theory, introduced by Saharon Shelah (1978), that deals with the cofinality of the ultraproducts of ordered sets. It gives strong upper bounds on the cardinalities of power sets of singular cardinals, and has… … Wikipedia
