Zobrazeno 1 - 1
of 1
pro vyhledávání: '"05C80 (Primary) 62R99 (Secondary)"'
Autor:
Babson, Eric, Spaliński, Jan
The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of parameters
Externí odkaz:
http://arxiv.org/abs/2309.05149
