diff --git a/src/sage/graphs/generic_graph.py b/src/sage/graphs/generic_graph.py
index dfd173d2d00..5cc9122c7f0 100644
--- a/src/sage/graphs/generic_graph.py
+++ b/src/sage/graphs/generic_graph.py
@@ -6574,7 +6574,7 @@ def edge_disjoint_spanning_trees(self, k, algorithm=None, root=None, solver=None
 
         Check the validity of the algorithms for undirected graphs::
 
-            sage: g = graphs.RandomGNP(30, .4)
+            sage: g = graphs.RandomGNP(12, .7)
             sage: k = Integer(g.edge_connectivity()) // 2
             sage: trees = g.edge_disjoint_spanning_trees(k, algorithm="MILP")
             sage: all(t.is_tree() for t in trees)