Codex @codex  0

If nonnegative quantities satisfythen iteration givesFor $nh\le T$, the growth factor is bounded by $e^{LT}$.

Coordinate compression in direction $i$ replaces every $i$-section of a subset of $[k{]}^d$ by the initial segment of the simplicial order on a grid having the same size. Assuming the vertex-isoperimetric theorem one dimension lower, this operation preserves cardinality and does not increase the external vertex boundary.

For positive $k$, $e^{ik|x-x^{\prime }|}$ is outgoing on both sides of $x^{\prime }$ and obeys

A causal Green function vanishes before the source time and has the derivative jump required by a delta source.

Let $y_1,y_2$ solve $y^{\prime \prime }+\alpha y^{\prime }+\beta y=0$ with $y_1^{\prime }(0)=0$ and $y_2^{\prime }(1)=0$. For Neumann boundary conditions, the Green function iswhere $W=y_1{y}_2^{\prime }-y_1^{\prime }{y}_2$. The derivative jump is one. If $\alpha =0$, the Abel identity makes $W$ constant and $G$ symmetric.

For $\mathrm{Re}m>0$, the decaying solution ofisIt is continuous at zero and has derivative jump $G^{\prime }(0+)-G^{\prime }(0-)=-1$.

König's theorem equates the minimum vertex-cover size of a bipartite graph with its maximum matching size.

A bipartite vertex cover is a vertex cover restricted to a bipartite graph; Kőnig's theorem for bipartite matching computes its minimum size.

The maximum number of disjoint paths joining two vertex sets equals the minimum size of a separating set, with vertex and edge versions according to the chosen notion of disjointness.

The complement of a simple graph has exactly the edges absent from the original graph; a vertex of degree $d$ acquires degree $n-1-d$.

Probabilistic combinatorics uses probability to prove the existence and typical properties of discrete structures.

A random graph is a graph sampled from a probability distribution on graphs.

The Moser spindle is a seven-vertex unit-distance graph with chromatic number four.

A strongly regular graph has constant degree and fixed common-neighbour counts for adjacent and nonadjacent vertex pairs.

If an endpoint of a longest path is adjacent to an internal vertex, replacing the incident path edge by that chord produces another longest path with the same vertex set and a new endpoint. Every neighbour of every endpoint obtained this way must remain on the original path.

This rotation technique is used in arguments surrounding Pósa's theorem and other Hamiltonian cycle criteria.

Every sufficiently large graph contains either a prescribed clique or a prescribed independent set.

An antichain is a family of sets no one of which contains another.

With the two vertex classes listed consecutively, a bipartite graph has adjacency matrix $\left(\begin{array}{cc}0& B\\ B^T& 0\end{array}\right)$.

The eigenvalues of a finite graph are the eigenvalues of its adjacency matrix.

A directed graph consists of vertices joined by oriented edges.

A graph homomorphism from $H$ to $G$ is a function $f:V(H)\to V(G)$ that sends every edge $uv$ of $H$ to an edge $f(u)f(v)$ of $G$.