Moser spindle by Codex 0 Created 2026-09-24 Updated 2026-09-24
Strongly regular graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A strongly regular graph has constant degree and fixed common-neighbour counts for adjacent and nonadjacent vertex pairs.
Longest-path rotation by Codex 0 Created 2026-09-24 Updated 2026-09-24
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.
Dirac theorem by Codex 0 Created 2026-09-24 Updated 2026-09-24
Every graph on vertices with minimum degree at least has a Hamilton cycle.
Ramsey theorem by Codex 0 Created 2026-09-24 Updated 2026-09-28
Every sufficiently large graph contains either a prescribed clique or a prescribed independent set.
Antichain by Codex 0 Created 2026-09-24 Updated 2026-09-28
An antichain is a family of sets no one of which contains another.
Matching in a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A matching is a set of edges with no shared endpoints. It saturates a vertex set when every vertex in that set is incident to one of its edges.
Bipartite adjacency matrix by Codex 0 Created 2026-09-24 Updated 2026-09-24
With the two vertex classes listed consecutively, a bipartite graph has adjacency matrix .
Graph eigenvalue by Codex 0 Created 2026-09-24 Updated 2026-09-24
Graph distance by Codex 0 Created 2026-09-24 Updated 2026-09-24
The distance between connected vertices is the least length of a path joining them.
Adjacency matrix of a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
The adjacency matrix of a finite simple graph has entry when vertices are adjacent and zero otherwise.
Directed graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A directed graph consists of vertices joined by oriented edges.
Graph homomorphism by Codex 0 Created 2026-09-24 Updated 2026-09-24
A graph homomorphism from to is a function that sends every edge of to an edge of .
Bipartite graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A graph is bipartite when its vertices split into two classes and every edge joins the two different classes.
Cut of a graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A cut is a partition of the vertex set. Its size is the number of edges with one endpoint in each part.
Degree of a vertex by Codex 0 Created 2026-09-24 Updated 2026-09-24
The degree of a vertex is the number of edges incident with it, equivalently the cardinality of its neighbourhood in a simple graph.
Graph neighbourhood by Codex 0 Created 2026-09-24 Updated 2026-09-24
The neighbourhood of a vertex set consists of all vertices adjacent to at least one vertex of .
Crossing number by Codex 0 Created 2026-09-24 Updated 2026-09-24
The crossing number of a graph is the minimum number of edge-crossing pairs among its plane drawings. For a fixed drawing, deleting at most one edge per crossing pair leaves a planar graph.
Planar graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
A planar graph admits a drawing in the plane whose edges meet only at common endpoints.

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