Think about how you can say which kids in class are friends. A relation is just a list of pairs that go together: Sam-and-Alex are friends, Mia-and-Jo are friends. Anyone can check the list. That is what a relation does: it tells you which things go together under some rule.
Rule for Pairs
A relation is a way of saying that certain things go together according to some rule. "Is the parent of," "is taller than," and "lives in the same city as" are all relations. You can write a relation as a list of pairs (or triples) that fit the rule, and every pair not on the list doesn't fit. Once you have such a list, you can do useful things with it: combine two relations, flip a relation around, or check if something is connected to something else through a chain.
Relation
A relation is a precise way of stating which combinations of things "belong together" under some rule. Formally, if you pick two sets — say all students and all clubs — a relation between them is just a chosen collection of pairs (student, club): the pairs in the relation count as "is a member of," and the rest don't. Relations can involve two things, three, or more. They're more general than functions (which require each input to map to exactly one output) and weaker than causal claims (which add direction and mechanism). Because a relation is just a set of tuples, you can use all the tools of set theory on it: union two relations, take the inverse, follow chains of links. This is the structural backbone of graphs, databases, and any classification system.
A relation is a specified pattern of association between elements: a designation of which combinations of entities stand together under some rule of interest. Formally, an n-ary relation is a subset of the Cartesian product of n sets — a chosen collection of n-tuples that count as "in the relation" while every other tuple is "out." Specifying a relation requires (i) the relata: which sets the entities are drawn from; (ii) the arity: how many entities participate in a single instance (binary like "is married to," ternary like "x lies between y and z"); and (iii) the membership rule, given either extensionally (a literal list) or intensionally (a predicate). The point of treating relations as first-class objects is that the whole machinery of set theory — union, intersection, complement, inverse, composition — becomes an algebra of associations. Structural properties a relation may possess (reflexivity, symmetry, transitivity, antisymmetry) license inferences that transfer wherever the relation appears: a partial order behaves like a partial order whether the relata are numbers, tasks in a project, or moral obligations. This is why graph theory, relational databases, order theory, and equivalence-based classification all rest on the same underlying construct.
Children (2) — more specific cases that build on this
Mach's PrinciplepresupposesRelation — Mach's principle presupposes relation because it grounds inertia in a body's relation to the total matter distribution.
OrderpresupposesRelation — Order presupposes relation because a ranking is a particular binary relation satisfying transitivity together with reflexivity or irreflexivity and antisymmetry or asymmetry.
Relation is not Set and Membership because a relation is a pattern of association between tuples of elements, while a set groups individual elements as a collection—a set answers "what elements belong?"; a relation answers "which multi-element combinations are connected?"—sets are elements; relations are structured associations of tuples.
Relation is not Equivalence Relation because an equivalence relation is a specific type of relation with three mandatory axioms (reflexivity, symmetry, transitivity), while relation is the general concept of any structured association—all equivalence relations are relations, but most relations are not equivalence relations.
Relation is not Graph (Network) because a graph is a visual and computational representation of nodes and edges encoding specific types of relations, while relation is the abstract structural concept of association itself—a graph is a concrete instantiation of binary relations; relation is the foundational concept that graphs encode.