On subgraphs of random Cayley sum graphs
Abstract
We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group G has edge density close to the expected one on every induced subgraph of size at least c |G|, for any fixed c > 1 and |G| large enough.
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.