Infinite paths and cliques in random graphs

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

We study the thresholds for the emergence of various properties in random subgraphs of (N;

Cite

CITATION STYLE

APA

Berarducci, A., Majer, P., & Novaga, M. (2012). Infinite paths and cliques in random graphs. Fundamenta Mathematicae, 216(2), 163–191. https://doi.org/10.4064/fm216-2-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free