Construct · 2 fields · 2 citations

Where does cut collide?

One name. Different field. Different construct. One map.

● jingle · one word, two constructs Nearest construct by meaningsplicingcompare the meanings
How to read this

Every construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to cut is splicing.

Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.

cut2 CONSTRUCTSDedekind cutDEDEKIND · REAL NUMBERMin-cutFORD-FULKERSON · MIN-CUT

Spokes are fields; dashed arcs are shared lineage. Tap a field for its definition, unit, and measures.

2026

Drag to watch the word get claimed. Each field appears at the publication date of the earliest source cited for it. Tap a year to see which.

Mathematics

A real number as a split of the rationals

A way of defining a real number as a division of all the rational numbers into two groups, a lower group and an upper group, where every number in the lower group is smaller than every number in the upper group. Dedekind's 1872 Stetigkeit und irrationale Zahlen (Continuity and Irrational Numbers) introduced this construction to give the real number line a rigorous foundation, so that a value with no rational name, such as the square root of two, is pinned down exactly by the split it makes among the rationals. The referent is a partition of an ordered number set that names one real number, not a transition between film shots, a division of a network, or a break in a DNA strand.[1]

Unit
One real number, given as a single split of the rationals into a lower and an upper part
Recovery means
Not applicable
Measured by
Constructed formally: a real number is identified with the pair of rational-number groups its split produces, and arithmetic is defined on those groups

Graph theory and optimization

A node partition separating source from sink

A division of a network's nodes into two groups that separates a source from a sink, whose value is the total capacity of the links running from the source group to the sink group. Ford and Fulkerson's 1956 Maximal Flow Through a Network proved that the largest flow that can be pushed from source to sink equals the capacity of the smallest such division, the max-flow min-cut theorem. The referent is a set of network links whose removal severs source from sink, valued in units of capacity, not a split of the rationals, a film edit, or a break in a DNA strand.[2]

Unit
One partition of a network's nodes separating source from sink, valued by the capacity crossing it
Recovery means
Not applicable
Measured by
Found by maximum-flow algorithms, which locate the smallest cut capacity in a network of capacitated links

Next

Run it through the Collider, or take the citations with you.

See how cut sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this collision

Nearby collisions

partition3 fields · 3 citationsjingle · one word, three constructsflow6 names · 12 citationsjangle · five names, one experience, partlyedge5 fields · 5 citationsjingle · one word, five constructs

References

  1. Dedekind, R. (1872). Stetigkeit und irrationale Zahlen [Continuity and irrational numbers]. Vieweg.
  2. Ford, L. R., Jr., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404. https://doi.org/10.4153/CJM-1956-045-5

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct