Search Results for ""

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

A plane curve is a curve that lies in a single plane. A plane curve may be closed or open. Curves which are interesting for some reason and whose properties have therefore ...

Plouffe's constants are numbers arising in summations of series related to r_n=f(2^n) where f is a trigonometric function. Define the Iverson bracket function rho(x)={1 for ...

The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...

P is the point on the line AB such that PA^_/PB^_=1. It can also be thought of as the point of intersection of two parallel lines. In 1639, Desargues (1864) became the first ...

Poker is a card game played with a normal deck of 52 cards. Sometimes, additional cards called "jokers" are also used. In straight or draw poker, each player is normally ...

Let p(d) be the probability that a random walk on a d-D lattice returns to the origin. In 1921, Pólya proved that p(1)=p(2)=1, (1) but p(d)<1 (2) for d>2. Watson (1939), ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...