Search Results for ""

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

Tutte's (46-vertex) graph is a cubic nonhamiltonian graph contructed by Tutte (1946) as a counterexample to Tait's Hamiltonian graph conjecture by using three copies ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

Probability and Statistics

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

The term "cylinder" has a number of related meanings. In its most general usage, the word "cylinder" refers to a solid bounded by a closed generalized cylinder (a.k.a. ...