TOPICS
Search

Search Results for ""


1321 - 1330 of 2186 for k Connected GraphSearch Results
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...
Let f(z) be a transcendental meromorphic function, and let D_1, D_2, ..., D_5 be five simply connected domains in C with disjoint closures (Ahlfors 1932). Then there exists j ...
The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...
A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...
The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...
The radius of an excircle. Let a triangle have exradius r_A (sometimes denoted rho_A), opposite side of length a and angle A, area Delta, and semiperimeter s. Then r_1 = ...
The harmonic conjugate to a given function u(x,y) is a function v(x,y) such that f(x,y)=u(x,y)+iv(x,y) is complex differentiable (i.e., satisfies the Cauchy-Riemann ...
Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...
1 ... 130|131|132|133|134|135|136 ... 219 Previous Next

...