Search Results for ""

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...

A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

An apodization function given by A(x)=(21)/(50)+1/2cos((pix)/a)+2/(25)cos((2pix)/a), (1) which has full width at half maximum of 0.810957a. This function is defined so that ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

A curve named and studied by Newton in 1701 and contained in his classification of cubic curves. It had been studied earlier by L'Hospital and Huygens in 1692 (MacTutor ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...