A Note on τ-Critical Linear Hypergraphs
نویسنده
چکیده
J.P. Roudnee as well as R. Aharoni and R. Ziv conjectured that every-critical linear hyper-graph has at most ? +1 2 edges. In this note we prove this conjecture for 5, and obtain a nontrivial upper bound for general .
منابع مشابه
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...
متن کاملMaximal t-Critical Linear Hypergraphs
A construction using finite affine geometries is given to show that the maximum number of edges in a τ -critical linear hypergraph is (1−o(1))τ2. This asymptotically answers a question of Roudneff [14], Aharoni and Ziv [1]. 1 This copy was printed on November 16, 2001. Submitted to Graphs and Combinatorics
متن کاملEquality of domination and transversal numbers in hypergraphs
The domination number γ(H) and the transversal number τ(H) (also called vertex covering number) of a hypergraph H are defined analogously to those of a graph. A hypergraph is of rank k if each edge contains at most k vertices. The inequality τ(H) ≥ γ(H) is valid for every hypergraph H without isolated vertices. We study the structure of hypergraphs satisfying τ(H) = γ(H), moreover prove that th...
متن کاملTransversals and Independence in Linear Hypergraphs with Maximum Degree Two
For k > 2, let H be a k-uniform hypergraph on n vertices and m edges. Let S be a set of vertices in a hypergraph H. The set S is a transversal if S intersects every edge of H, while the set S is strongly independent if no two vertices in S belong to a common edge. The transversal number, τ(H), of H is the minimum cardinality of a transversal in H, and the strong independence number of H, α(H), ...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 13 شماره
صفحات -
تاریخ انتشار 1997