3-Symmetric Graphs
Combinatorics
2020-03-10 v1
Abstract
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with vertices to be -symmetric. We discuss some properties and examples of such graphs. We construct 3-symmetric graphs and provide some statistics.
Cite
@article{arxiv.2003.03870,
title = {3-Symmetric Graphs},
author = {Sebastian Jeon and Tanya Khovanova},
journal= {arXiv preprint arXiv:2003.03870},
year = {2020}
}
Comments
17 pages, 5 figures