Search Results for ""

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

A four-sided quadrilateral not contained in a plane. The lines connecting the midpoints of opposite sides of a skew quadrilateral intersect (and bisect) each other (Steinhaus ...

The h-statistic h_r is the unique symmetric unbiased estimator for a central moment of a distribution <h_r>=mu_r. (1) In addition, the variance var(h_r)=<(h_r-mu_r)^2> (2) is ...

A mathematical object (such as a set or function) is said to bounded if it possesses a bound, i.e., a value which all members of the set, functions, etc., are less than.

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).