A Note on Intersecting Hypergraphs with Large Cover Number
نویسندگان
چکیده
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r − 4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
منابع مشابه
Coverings and matchings in r-partite hypergraphs
Ryser’s conjecture postulates that, for r-partite hypergraphs, τ ≤ (r − 1)ν where τ is the covering number of the hypergraph and ν is the matching number. Although this conjecture has been open since the 1960s, researchers have resolved it for special cases such as for intersecting hypergraphs where r ≤ 5. In this paper, we prove several results pertaining to matchings and coverings in r-partit...
متن کاملA Comment on Ryser's Conjecture for Intersecting Hypergraphs
Let τ(H) be the cover number and ν(H) be the matching number of a hypergraph H. Ryser conjectured that every r-partite hypergraph H satisfies the inequality τ(H) ≤ (r − 1)ν(H). This conjecture is open for all r ≥ 4. For intersecting hypergraphs, namely those with ν(H) = 1, Ryser’s conjecture reduces to τ(H) ≤ r − 1. Even this conjecture is extremely difficult and is open for all r ≥ 6. For infi...
متن کاملA note on the edge cover number and independence number in hypergraphs
Consider a hypergraph of rank r > 2 with m edges, independence number and edge cover number . We prove the inequality (r − 2)m+ r − 1 . One application of this inequality is a special case of a conjecture of Aharoni and the first author extending Ryser’s Conjecture to matroids. © 2007 Elsevier B.V. All rights reserved.
متن کاملOn Helly Hypergraphs with Variable Intersection Sizes
A hypergraphH is said to be p-Helly when every p-wise intersecting partial hypergraph H′ of H has nonempty total intersection. Such hypergraphs have been characterized by Berge and Duchet in 1975, and since then they have appeared in the literature in several contexts, especially for the case p = 2, in which they are referred simply as Helly hypergraphs. An interesting generalization of p-Helly...
متن کاملEdit Distance in Graphs
The focus of my research is extremal graph theory and random combinatorial structures. I have also worked in a variety of other areas, including intersecting hypergraphs, the theory of positional games and Ramsey theory. I use a number of tools in my research, notably probabilistic methods and, most prominently, Szemerédi’s regularity lemma. I have used these and other techniques to address que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017