scholarly journals Cache-Oblivious Peeling of Random Hypergraphs

2014 ◽  
Author(s):  
Djamal Belazzougui ◽  
Paolo Boldi ◽  
Giuseppe Ottaviano ◽  
Rossano Venturini ◽  
Sebastiano Vigna
Keyword(s):  
Random Hypergraphs ◽  
Cache Oblivious

Panchromatic colorings of random hypergraphs

2021 ◽  
Vol 31 (1) ◽  
pp. 19-41
Author(s):  
D. A. Kravtsov ◽  
N. E. Krokhmal ◽  
D. A. Shabanov
Keyword(s):  
Binomial Model ◽  
Threshold Probability ◽  
The Difference ◽  
Random Hypergraphs

Abstract We study the threshold probability for the existence of a panchromatic coloring with r colors for a random k-homogeneous hypergraph in the binomial model H(n, k, p), that is, a coloring such that each edge of the hypergraph contains the vertices of all r colors. It is shown that this threshold probability for fixed r < k and increasing n corresponds to the sparse case, i. e. the case p = c n / ( n k ) $p = cn/{n \choose k}$ for positive fixed c. Estimates of the form c 1(r, k) < c < c 2(r, k) for the parameter c are found such that the difference c 2(r, k) − c 1(r, k) converges exponentially fast to zero if r is fixed and k tends to infinity.

On Spanning Structures in Random Hypergraphs

2015 ◽  
Vol 49 ◽  
pp. 611-619 ◽  
Author(s):  
O. Parczyk ◽  
Y. Person
Keyword(s):  
Random Hypergraphs

Cache-oblivious matrix algorithms in the age of multicores and many cores

2012 ◽  
Vol 27 (9) ◽  
pp. 2215-2234 ◽  
Author(s):  
Alexander Heinecke ◽  
Carsten Trinitis
Keyword(s):  
Matrix Algorithms ◽  
Cache Oblivious

Two-coloring random hypergraphs

2002 ◽  
Vol 20 (2) ◽  
pp. 249-259 ◽  
Author(s):  
Dimitris Achlioptas ◽  
Jeong Han kim ◽  
Michael Krivelevich ◽  
Prasad Tetali
Keyword(s):  
Random Hypergraphs
Sign in / Sign up

Export Citation Format

Share Document