We have 2 of 277 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
These results do not resolve the existence problem, but they reduce the exact search space and improve the best verified partial construction found in the authors' experiments.
The likelihood of a finite simple undirected graph $G$ on $n$ vertices is the probability that the uniform sequential attachment process, which at each step joins a new vertex to a uniformly random subset of uniformly random size of the vertices already present, outputs a graph isomorphic to $G$. Dervovic, Mocherla and...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
