Covers in hypergraphs

Let α(H) denote the stability number of a hypergraphH. The covering number ?(H) is defined as the minimal number of edges fromH to cover its vertex setV(H). The main result is the following extension of König’s wellknown theorem: If α(H′)≧|V(H′)|/2 holds for every section hypergraphH′ ofH then ?(H)≦α(H). This theorem is applied to obtain upper bounds on certain covering numbers of graphs and hypergraphs. In par ticular, we prove a conjecture of B. Bollobás involving the hypergraph Turán numbers.     

t-expansive andt-wise intersecting hypergraphs

We give a hypergraph generalization of Gallai's theorem about factor-critical graphs. This result can be used to determine ^*(r, t) forr < 3t/2, where ^*(r, t) denotes the maximum value of the fractional covering numbers oft-wise intersecting hypergraphs of rankr. Dedicated to Tibor Gallai     

Critical hypergraphs and intersecting set-pair systems

A method is given for solving extremal problems of the following type: determine the maximal number of vertices in a class of hypergraphs. Results are applied for τ-critical and ν-critical hypergraphs.     

Finite projective spaces and intersecting hypergraphs

Let ? be a family ofk-subsets on ann-setX andc be a real number 0 <c<1. Suppose that anyt members of ? have a common element (t ≧ 2) and every element ofX is contained in at mostc|?| members of ?. One of the results in this paper is (Theorem 2.9): If $$c = {{(q^{t - 1} + ... + q + 1)} \mathord{\left/ {\vphantom {{(q^{t - 1} + ... + q + 1)} {(q^t + ... + q + 1)}}} \right. \kern-\nulldelimiterspace} {(q^t + ... + q + 1)}}$$ . whereq is a prime power andn is sufficiently large, (n >n (k, c)) then The corresponding lower bound is given by the following construction. LetY be a (q ^t + ... +q + 1)-subset ofX andH ₁,H ₂, ...,H _|Y| the hyperplanes of thet-dimensional projective space of orderq onY. Let ? consist of thosek-subsets which intersectY in a hyperplane, i.e., ?={F∈( _k ^X ): there exists ani, 1≦i≦|Y|, such thatY∩F=H _i }.     

Great intersecting families of edges in hereditary hypergraphs

Chvátal stated in 1972 the following conjecture: If $\text{H}$ is a hereditary hypergraph on S and $\text{M}$ ? $\text{H}$ is a family of maximum cardinality of pairwise intersecting members of $\text{H}$, then there exists an x ∈ S such that d_$\text{H}$(x) = |{H ∈ $\text{H}$: x ∈ H}| = |$\text{M}$|. Berge and Schönheim proved that |$\text{M}$|?$\text{1}\text{2}$|$\text{H}$| for every $\text{H}$ and $\text{M}$. Now we prove that if there exists an $\text{M}$ ? $\text{H}$, |$\text{M}$| = $\text{1}\text{2}$|$\text{H}$| then Chvátal's conjecture is true for this $\text{H}$.     

On hypergraphs without two edges intersecting in a given number of vertices

Let X be a finite set of n-melements and suppose t ? 0 is an integer. In 1975, P. Erdös asked for the determination of the maximum number of sets in a family $\text{F}$ = {F₁,…, F_m}, F_i ? X, such that ∥F_i ∩ F_j∥ ≠ t for 1 ? i ≠ j ? m. This problem is solved for n ? n₀(t). Let us mention that the case t = 0 is trivial, the answer being 2^{n ? 1}. For t = 1 the problem was solved in [3]. For the proof a result of independent interest (Theorem 1.5) is used, which exhibits connections between linear algebra and extremal set theory.     

Interval hypergraphs and D-interval hypergraphs

A hypergraph $\text{H = (V,}\text{E}\text{)}$ is called an interval hypergraph if there exists a one-to-one function ? mapping the elements of V to points on the real line such that for each edge E, there is an interval I, containing the images of all elements of E, but not the images of any elements not in E₁. The difference hypergraph D(H) determined by H is formed by adding to $\text{E}$ all nonempty sets of the form E₁ ? E₁, where E₁ and E₁ are edges of HH is said to be a D-interval hypergraph if D(H) is an interval hypergraph. A forbidden subhypergraph characterization of D-interval hypergraphs is given. By relating D-interval hypergraphs to dimension theory for posets, we determine all 3-irreducible posets of length one.     

DG-Injective Covers, #-Injective Covers

Let R be a left noetherian ring. We show that every complex of left R-modules has a #-injective cover. We use this result to prove that the class of DG-injective complexes is covering if and only if the ring R is regular.     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

超图中的C-圈

在本文我们给出了一个新的定义C-圈.设f(n,k,r)是不含C-圈的n阶r-一致超图的最大可能边数,我们主要是确定f(n,k,r)或给出它的一个下界.另外,我们给出了超图不含C-圈的一个充分必要条件.     

Lines in hypergraphs

One of the De Bruijn-Erd?s theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of simply described families, near-pencils and finite projective planes. Chen and Chvátal proposed to define the line uv in a 3-uniform hypergraph as the set of vertices that consists of u, v, and all w such that {u;v;w} is a hyperedge. With this definition, the De Bruijn-Erd?s theorem is easily seen to be equivalent to the following statement: If no four vertices in a 3-uniform hypergraph carry two or three hyperedges, then, except in the perverse case where one of the lines equals the whole vertex set, the number of lines is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of two simply described families. Our main result generalizes this statement by allowing any four vertices to carry three hyperedges (but keeping two forbidden): the conclusion remains the same except that a third simply described family, complements of Steiner triple systems, appears in the extremal case.     

Threshold hypergraphs

This paper deals with three generalizations of threshold graphs to hypergraphs proposed by M. Ch. Golumbic. Answering a question of M. Ch. Golumbic we show that these three definitions are not equivalent. The main results of the paper are Theorems 2.5 and 2.6 which characterize hypergraphs satisfying the most general of above definitions.     

Hamiltonian chains in hypergraphs

A cyclic ordering of the vertices of a k‐uniform hypergraph is called a hamiltonian chain if any k consecutive vertices in the ordering form an edge. For k = 2 this is the same as a hamiltonian cycle. We consider several natural questions about the new notion. The main result is a Dirac‐type theorem that provides a sufficient condition for finding hamiltonian chains in k‐uniform hypergraphs with large (k − 1)‐minimal degree. If it is more than than the hypergraph contains a hamiltonian chain. © 1999 Wiley & Sons, Inc. J Graph Theory 30: 205–212, 1999     

Small transversals in hypergraphs

For each positive integerk, we consider the setA _k of all ordered pairs [a, b] such that in everyk-graph withn vertices andm edges some set of at mostam+bn vertices meets all the edges. We show that eachA _k withk2 has infinitely many extreme points and conjecture that, for every positive , it has only finitely many extreme points [a, b] witha. With the extreme points ordered by the first coordinate, we identify the last two extreme points of everyA _k , identify the last three extreme points ofA ₃, and describeA ₂ completely. A by-product of our arguments is a new algorithmic proof of Turán's theorem.     

Partitive hypergraphs

We define a new class of hypergraphs (partitive hypergraphs) which generalizes both, the set of all externally related subsets of a graph and the set of all committees of an hypergraph.We give a characterization of the partitive hypergraphs and moreover of those which are associated with hypergraphs or graphs.     

Quasi-random hypergraphs

We introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi-random. With these results, it becomes quite easy to show that many natural explicit constructions result in hypergraphs which imitate random hypergraphs in a variety of ways.