diff --git a/src/sage/combinat/posets/poset_examples.py b/src/sage/combinat/posets/poset_examples.py
index b349745bef5..0e16a16e90c 100644
--- a/src/sage/combinat/posets/poset_examples.py
+++ b/src/sage/combinat/posets/poset_examples.py
@@ -29,7 +29,7 @@
     :meth:`~Posets.RestrictedIntegerPartitions` | Return the poset of integer partitions of `n`, ordered by restricted refinement.
     :meth:`~Posets.ShardPoset` | Return the shard intersection order.
     :meth:`~Posets.SSTPoset` | Return the poset on semistandard tableaux of shape `s` and largest entry `f` that is ordered by componentwise comparison.
-    :meth:`~Posets.StandardExample` | Return the standard example of a poset with dimension 'n'.
+    :meth:`~Posets.StandardExample` | Return the standard example of a poset with dimension `n`.
     :meth:`~Posets.SymmetricGroupBruhatIntervalPoset` | The poset of permutations with respect to Bruhat order.
     :meth:`~Posets.SymmetricGroupBruhatOrderPoset` | The poset of permutations with respect to Bruhat order.
     :meth:`~Posets.SymmetricGroupWeakOrderPoset` | The poset of permutations of `\{ 1, 2, \ldots, n \}` with respect to the weak order.
@@ -544,6 +544,14 @@ def StandardExample(n, facade=None):
             sage: A.dimension()
             3
 
+        REFERENCES:
+
+        .. [Rosen] K. Rosen *Handbook of Discrete and Combinatorial
+           Mathematics* (1999), Chapman and Hall.
+
+        .. [Garg] V. Garg *Introduction to Lattice Theory with Computer
+           Science Applications* (2015), Wiley.
+
         TESTS::
 
             sage: A = Posets.StandardExample(10); A