From 808df7b4d4ae968a4f234cbc83978f429a23df7f Mon Sep 17 00:00:00 2001
From: "Thomas (Tom) C. Gorordo" <57684088+tgorordo@users.noreply.github.com>
Date: Mon, 25 May 2026 14:44:40 -0700
Subject: [PATCH] Update README.md

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 3b22499..0f22514 100644
--- a/README.md
+++ b/README.md
@@ -1,9 +1,9 @@
 # Smithy
 *A simple Smith set solver for ranked-choice ballots.* 
 
-The Smith set is the minimal set of election candidates which can beat all others pairwise
+The [Smith set](https://en.wikipedia.org/wiki/Smith_set) is the minimal set of election candidates which can beat all others pairwise
 (by simple majority ranking preference) - if there is a single winner in the set they are 
-guaranteed the standard Condorcet i.e. Majority winner (they beat all others pairwise). 
+guaranteed the standard [Condorcet i.e. Majority winner](https://en.wikipedia.org/wiki/Condorcet_winner) (they beat all others pairwise). 
 
 `smithy` identifies the Smith set via graph Strongly Connected Component (SCC) analysis of
 the pairwise majority graph using [`rustworkx`](https://www.rustworkx.org/).