# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1371650805 7200
# Node ID 485c2dca961af9c64498a8ef30d6ccc994ef87f4
# Parent 6858c13cedd15127ffe9381e060a1ad761893a17
Adding Method for testing avoidance in posets  fixed reference in the docstring
diff git a/sage/combinat/posets/posets.py b/sage/combinat/posets/posets.py
a

b


1543  1543  If ``m`` is a tuple of pairs of chain lengths, returns ``True`` if the poset 
1544  1544  does not contain a pair of incomparable chains whose lengths comprise 
1545  1545  one of the chain pairs, and ``False`` if not. 
1546   
1547  1546  A poset is `(m+n)`free if it contains no induced subposet that is 
1548  1547  isomorphic to the poset consisting of two disjoint chains of lengths 
1549  1548  `m` and `n`. See, for example, Exercise 15 in Chapter 3 of 
1550   Stanley, *Enumerative Combinatorics, Volume 1*, 2nd edition. 
 1549  [EnumComb1]_. 
1551  1550  
1552  1551  INPUT: 
1553  1552  
… 
… 

1619  1618  AUTHOR: 
1620  1619  
1621  1620   Eric Rowland (20130528) 
 1621  
 1622  REFERENCES: 
 1623  
 1624  .. [EnumComb1] Enumerative Combinatorics I, 
 1625  Second Edition, 
 1626  Richard P. Stanley, 
 1627  Cambridge University Press (2011) 
1622  1628  """ 
1623  1629  if n is None: 
1624  1630  try: 