Sweeping Graphs with Large Clique Number

摘要

An open problem in sweeping is the existence of a graph with connected sweep number strictly less than monotonic connected sweep number. We solve this problem by constructing a graph W exhibiting exactly this property. Further, we will examine a new method of constructing graphs that makes proving all such inequalities easier, and offer some new lower bounds on sweep numbers.