Uniquely Kr-Saturated Graphs
Abstract
A graph G is uniquely Kr-saturated if it contains no clique with r vertices and if for all edges e in the complement, G + e has a unique clique with r vertices. Previously, few examples of uniquely Kr-saturated graphs were known, and little was known about their properties. We search for these graphs by adapting orbital branching, a technique originally developed for symmetric integer linear programs. We find several new uniquely Kr-saturated graphs with 4 ≤ r ≤ 7, as well as two new infinite families based on Cayley graphs for Zn with a small number of generators.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.