12 search results - page 1 / 3 » A new approach to the orientation of random hypergraphs |
CORR
2012
Springer
12 years 19 days ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
RSA
2010
13 years 3 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
COMBINATORICS
2006
13 years 5 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
WEA
2010
Springer
13 years 10 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...