Infinite paths and cliques in random graphs
Probability
2011-03-29 v5 Combinatorics
Abstract
We study some percolation problems on the complete graph over . In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
Cite
@article{arxiv.0809.2335,
title = {Infinite paths and cliques in random graphs},
author = {A. Berarducci and P. Majer and M. Novaga},
journal= {arXiv preprint arXiv:0809.2335},
year = {2011}
}
Comments
18 pages