Search Results for ""

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...

Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

Let E be an elliptic curve defined over the field of rationals Q(sqrt(-d)) having equation y^2=x^3+ax+b with a and b integers. Let P be a point on E with integer coordinates ...

The doublestruck capital letter Z, Z, denotes the ring of integers ..., -2, -1, 0, 1, 2, .... The symbol derives from the German word Zahl, meaning "number" (Dummit and Foote ...

A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...