Size of k-uniform hypergraph with diameter d
نویسندگان
چکیده
منابع مشابه
ON SENSITIVITY OF k-UNIFORM HYPERGRAPH PROPERTIES
In this paper we present a graph property with sensitivity Θ( √ n), where n = (v 2 ) is the number of variables, and generalize it to a k-uniform hypergraph property with sensitivity Θ( √ n), where n = (v k ) is again the number of variables. This yields the smallest sensitivity yet achieved for a k-uniform hypergraph property. We then show that, for even k, there is a k-uniform hypergraph prop...
متن کاملOn the Sensitivity of k-Uniform Hypergraph Properties
In this paper we present a graph property with sensitivity Θ( √
متن کاملOn the Sensitivity Complexity of k-Uniform Hypergraph Properties
In this paper we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n⌈k/3⌉) for any k ≥ 3, where n is the number of vertices. Moreover, we can do better when k ≡ 1 (mod 3) by presenting a k-uniform hypergraph property with sensitivity O(n⌈k/3⌉−1/2). This result disproves a conjecture of Babai [1], which conje...
متن کاملThe degree, size and chromatic index of a uniform hypergraph
Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every > 0, if D is sufficiently large as a function of t, k and , then the chromatic index of H is at most (t − 1 + 1/t + )D. We prove this conjecture for the special case of intersecting hypergraphs in the following stronger form:...
متن کاملSMALLEST n-UNIFORM HYPERGRAPH WITH POSITIVE DISCREPANCY
A two-coloring of the vertices X of the hypergraph H = ( X , o °) by red and blue has discrepancy d if d is the largest difference between the number of red and blue points in any edge. A two-coloring is an equipartition of H if it has discrepancy 0, i.e., every edge is exactly half red and half blue. Letf(n) be the fewest number of edges in an n-uniform hypergraph (all edges have size n) havin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00593-9