Abstract | ||
---|---|---|
It is shown that with probability tending to 1 as r → ∞ a random subset ω r ( n ) of n elements of the projective space PG( r − 1, q ) becomes k -connected when n = r + ( k − 1) log q r + O(1). Furthermore, the cyclic structure of ω r ( n ) is considered, and a similar very sharp threshold for the existence of circuits of length r is found. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1016/S0012-365X(98)00201-5 | Discrete Mathematics |
Keywords | Field | DocType |
projective space,random subsets | Discrete mathematics,Combinatorics,Correlation,Mathematics,Projective space,Projective test | Journal |
Volume | Issue | ISSN |
196 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.79 | 1 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wojciech Kordecki | 1 | 12 | 6.04 |
Tomasz Łuczak | 2 | 225 | 40.26 |