On robustly asymmetric graphs
Discrete Mathematics
2014-02-06 v1 Combinatorics
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 , 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.
Keywords
Cite
@article{arxiv.1402.1047,
title = {On robustly asymmetric graphs},
author = {Uriel Feige},
journal= {arXiv preprint arXiv:1402.1047},
year = {2014}
}