Update src/graph-theory/complete-bipartite-graphs.lagda.md

Co-authored-by: Vojtěch Štěpančík <[email protected]>
UniMath · Nov 28, 2023 · 8a5fe0b · 8a5fe0b
1 parent 871284b
commit 8a5fe0b
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/src/graph-theory/complete-bipartite-graphs.lagda.md b/src/graph-theory/complete-bipartite-graphs.lagda.md
@@ -34,7 +34,7 @@ consisting of:
 - The finite set of vertices is the
   [coproduct type](univalent-combinatorics.coproduct-types.md) `X + Y`.
 - Given an [unordered pair](foundation.unordered-pairs.md) `f : I → X + Y` of
-  vertices, an the finite type of edges on the unordered pair `(I , f)` is given
+  vertices, the finite type of edges on the unordered pair `(I , f)` is given
   by
 
   ```text