Search Results for ""

The twin primes constant Pi_2 (sometimes also denoted C_2) is defined by Pi_2 = product_(p>2; p prime)[1-1/((p-1)^2)] (1) = product_(p>2; p prime)(p(p-2))/((p-1)^2) (2) = ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

A generalization of the p-adic norm first proposed by Kürschák in 1913. A valuation |·| on a field K is a function from K to the real numbers R such that the following ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

Wyler's constant is defined as alpha_W = 9/(8pi^4)((pi^5)/(2^4·5!))^(1/4) (1) = 0.0072973... (2) = 1/(137.0360824...) (3) (Wyler 1969, 1971; OEIS A180872 and A180873), which ...

Discrete Mathematics

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

The constant e with decimal expansion e=2.718281828459045235360287471352662497757... (OEIS A001113) can be computed to 10^9 digits of precision in 10 CPU-minutes on modern ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...