From b24920c15a00f6910a9dc9fe7477ab1e528bb487 Mon Sep 17 00:00:00 2001
From: "Thomas (Tom) C. Gorordo" <57684088+tgorordo@users.noreply.github.com>
Date: Thu, 4 Jun 2026 12:19:39 -0700
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index c765103..b93a4a8 100644
--- a/README.md
+++ b/README.md
@@ -3,7 +3,7 @@
 
 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](https://en.wikipedia.org/wiki/Condorcet_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). (TODO: optionally resolve nontrivial Smith sets - ties - via plurality/IRV methods within the set).
 
 `smithy` identifies the Smith set via graph Strongly Connected Component (SCC) analysis of
 the pairwise majority graph using [`rustworkx`](https://www.rustworkx.org/).