Webb showed that the arc complex of a surface of high enough complexity does not satisfy a combinatorial isoperimetric inequality: that is, for every N, there is a loop of length 4 in the arc complex that only bounds discs containing at least N triangles. He showed that the same is true for the free splitting complex and the cyclic splitting complex associated with Out(Fn) and concludes that these complexes do not admit a CAT(0) metric with finitely many shapes. On the contrary, he proved that the curve complex satisfies a linear combinatorial isoperimetric inequality. In this talk, we will show that the free factor complex associated with Out(Fn) also fails to satisfy a combinatorial isoperimetric inequality.