On The Choice Number Of Random Hypergraphs
نویسنده
چکیده
We generalize the notion of choice number from graphs to hypergraphs and estimate the sharp order of magnitude of the choice number of random hypergraphs. It turns out that the choice number and the chromatic number of a random hypergraph have the same order of magnitude, almost surely. Our result implies an earlier bound on the chromatic number of random hypergraphs, proved by Schmidt [Sch] using a different method.
منابع مشابه
Directed domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملOn some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np/ log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP-hard. The first goal of this paper is to show that the above mentioned upper bound on the chromatic number can be guaranteed by simple degree conditions, which are s...
متن کاملLarge Hinge Width on Sparse Random Hypergraphs
Consider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n) or O(n lnn). When k = 2, these are exactly the classical Erdös-Rényi random graphs G(n, p). We prove that with high probability, hinge width on these sparse random hypergraphs ca...
متن کاملOn Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping hypergraphs we give a solution for the optimal (expected) number of edges of each size such that the 2-core threshold for the resulting mixed hypergraph is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 9 شماره
صفحات -
تاریخ انتشار 2000