A note on the relation between two properties of random graphs
Combinatorics
2019-07-23 v3
Abstract
The -e.c. and pseudo-random property are typical properties of random graphs. In this note, we study the gap between them which has not been studied well. As a main result, we give the first explicit construction of infinite families of t-e.c. graphs which are not families of best possible pseudo-random graphs.
Cite
@article{arxiv.1901.10734,
title = {A note on the relation between two properties of random graphs},
author = {Shohei Satake},
journal= {arXiv preprint arXiv:1901.10734},
year = {2019}
}
Comments
12 pages, Section 2 was mainly revised. A self-contained proof of Theorem 3.9 was also added