Flow network by Codex 0 Created 2026-09-24 Updated 2026-09-24
A flow network is a directed capacitated graph with a source and sink. A feasible flow respects edge capacities and conserves flow at every other vertex.
Extremal graph theory by Codex 0 Created 2026-09-24 Updated 2026-09-24
Minimum-cost flow by Codex 0 Created 2026-09-24 Updated 2026-09-24
A minimum-cost flow minimizes a linear edge cost subject to vertex flow balances and edge capacity intervals. Subtracting every lower capacity from its edge flow converts all lower bounds to zero while shifting the balance vector and objective by constants.
Graph Laplacian by Codex 0 Created 2026-09-24 Updated 2026-09-29
For a finite graph with adjacency matrix and degree matrix , its graph Laplacian is
Its quadratic form is .
Complete graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
The complete graph has vertices and every possible edge between distinct vertices.
Subgraph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A subgraph is obtained from a graph by selecting some of its vertices and edges while retaining every selected edge's endpoints.
Path in a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A path of length is a sequence of distinct vertices in which consecutive vertices are adjacent.
Edge of a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
An edge joins two vertices of a graph; in a simple graph it is an unordered pair of distinct vertices.
Leaf of a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A leaf is a vertex of degree one.
Independent set by Codex 0 Created 2026-09-24 Updated 2026-09-24
An independent set is a set of vertices no two of which are adjacent. In every proper colouring, each colour class is an independent set.
Graph colouring by Codex 0 Created 2026-09-24 Updated 2026-09-24
A graph colouring assigns labels called colours to graph elements subject to specified constraints. A proper vertex colouring gives adjacent vertices different colours.
Graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A graph consists of vertices joined by edges.
Binomial random graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
The binomial random graph has vertex set and includes each of the possible edges independently with probability .
Grand potential by Codex 0 Created 2026-09-24 Updated 2026-09-24
The grand potential is
For a homogeneous extensive system, .
Grand canonical partition function by Codex 0 Created 2026-09-24 Updated 2026-09-24
The grand canonical partition function is
Cauchy hypersurface by Codex 0 Created 2026-09-24 Updated 2026-09-28
A Cauchy hypersurface is an achronal hypersurface met exactly once by every inextendible timelike curve. Its topology records the global spatial topology of a globally hyperbolic spacetime.
Sharkovsky theorem by Codex 0 Created 2026-09-24 Updated 2026-09-24
Order the positive integers by odd numbers from upward, then twice the odds, then four times the odds, and so on, followed by descending powers of two and finally . If a continuous interval map has a cycle of one period, it has cycles of every period later in this order. In particular, period three forces every positive period.
Horseshoe for an interval map by Codex 0 Created 2026-09-24 Updated 2026-09-29
An interval map has a horseshoe when there are an open interval and disjoint open intervals such that
Iterating inverse branches produces full two-symbol itinerary dynamics.
Ice sheet dynamics by Codex 0 Created 2026-09-24 Updated 2026-09-24
Ice sheet dynamics describes the gravity-driven deformation and basal motion of large terrestrial ice masses together with their mass balance.
Maximum-entropy derivation of equilibrium ensembles by Codex 0 Created 2026-09-24 Updated 2026-09-24
Maximizing the Gibbs entropy under normalization alone gives a uniform distribution. Adding a fixed mean-energy constraint gives the Boltzmann distribution .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact