𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large dicliques in a directed inhomogeneous random graph

✍ Scribed by Shang, Yilun

Book ID
127314121
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
210 KB
Volume
90
Category
Article
ISSN
0020-7160

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A phase transition phenomenon in a rando
A phase transition phenomenon in a random directed acyclic graph
✍ B. Pittel; R. Tungol πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 158 KB

Let a random directed acyclic graph be defined as being obtained from the random graph G n p by orienting the edges according to the ordering of vertices. Let Ξ³ \* n be the size of the largest (reflexive, transitive) closure of a vertex. For p = c log n /n, we prove that, with high probability, Ξ³ \*

Finding a large hidden clique in a rando
Finding a large hidden clique in a random graph
✍ Noga Alon; Michael Krivelevich; Benny Sudakov πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 177 KB

We consider the following probabilistic model of a graph on n labeled vertices. ## Ε½ . First choose a random graph G n, 1r2 , and then choose randomly a subset Q of vertices of size k and force it to be a clique by joining every pair of vertices of Q by an edge. The problem is to give a polynomia