We consider two sub-classes of fully dynamic algorithms for maintaining a maximal matching, which we define as lazy algorithms and eager algorithms. We prove a conditional lower bound which is sub-linear in the number of edges for the update time of lazy algorithms and eager algorithms. Our result is conditioned on the well known conjecture about the hardness of triangle detection in a graph.

中文翻译：

---

懒惰或急切的动态匹配可能不会很快

我们考虑了用于维持最大匹配的全动态算法的两个子类，我们将它们定义为惰性算法和渴望算法。我们证明了一个条件下界，它在边数上是次线性的，用于延迟算法和热切算法的更新时间。我们的结果以关于图形中三角形检测的硬度的众所周知的猜测为条件。