Sciweavers

2079 search results - page 10 / 416
» Universality of random graphs
Sort
View
CCA
2005
Springer
16 years 1 months ago
Randomness and Universal Machines
Santiago Figueira, Frank Stephan, Guohua Wu
RSA
2010
108views more  RSA 2010»
15 years 5 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
15 years 9 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo
EJC
2010
15 years 7 months ago
On graphs isomorphic to their neighbour and non-neighbour sets
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
Przemyslaw Gordinowicz