Linked from

The 21 pages that link to Finite set, each with the reason it gives.

• PermutationNarrower topic: Permutations rearrange the elements of a finite set.

• Natural numberRelated: Natural numbers provide the standard sizes used to classify finite sets.

• Power setCompared with: Its power set has exactly 2ⁿ members when the set has n elements.

• Cartesian productRelated: For finite factors, the product size is the product of their cardinalities.

• Pigeonhole principleNarrower topic: The basic principle compares the sizes of finite sets of objects and containers.

• CardinalityBroader topic: Finite cardinalities recover the familiar notion of counting objects.

• Countable setBroader topic: Finite sets are included in the definition of countable.

• Inclusion–exclusion principleNarrower topic: The elementary counting identity applies directly to finite families of finite sets.

• Closed setBroader topic: Finite subsets of a Hausdorff space are closed, but this can fail in other spaces.

• Hall's marriage theoremRelated: Finiteness is essential to the theorem's stated setting and proof.

• Schur's theoremCompared with: The theorem concerns an infinite domain, while Schur numbers describe finite intervals that already force a solution.

• Cardinal numberRelated: Finite sets have cardinalities corresponding to ordinary counting numbers.

• Infinite setCompared with: Finite sets lack the self-matching behavior characteristic of infinite sets.

• Rule of productNarrower topic: The rule applies when each stage draws from a finite number of options.

• InfinityCompared with: Finite sets provide the direct opposite of infinite collections.

• Combinatorial proofNarrower topic: The two expressions in a basic combinatorial proof count a finite collection in different ways.

• Axiom of infinityCompared with: The axiom rules out a universe containing only finite sets.

• Handshaking lemmaRelated: Finiteness ensures the vertex degrees and total edge count have finite sums.

• Dilworth's theoremNarrower topic: Finiteness is an essential hypothesis for the stated theorem.

• Sylvester–Gallai theoremNarrower topic: Finiteness is essential to the theorem's guarantee.

• Erdős–Graham problemRelated: The conclusion demands a finite witness even though the hypothesis concerns an infinite sum.