On robustly asymmetric graphs
Abstract
O'Donnell, Wright, Wu and Zhou [SODA 2014] introduced the notion of robustly asymmetric graphs. Roughly speaking, these are graphs in which for every 0 1, every permutation that permutes a fraction of the vertices maps a () fraction of the edges to non-edges. We show that there are graphs for which the constant hidden in the notation is roughly~1.
0
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.