Maximum degree and fractional matchings in uniform hypergraphs

  title={Maximum degree and fractional matchings in uniform hypergraphs},
  author={Z. F{\"u}redi},
  • Z. Füredi
  • Published 1981
  • Mathematics, Computer Science
  • Combinatorica
AbstractLet ℋ be a family ofr-subsets of a finite setX. SetD(ℋ)= $$\mathop {\max }\limits_{x \in X} $$ |{E:x∈E∈ℋ}|, (maximum degree). We say that ℋ is intersecting if for anyH,H′ ∈ ℋ we haveH ∩H′ ≠ 0. In this case, obviously,D(ℋ)≧|ℋ|/r. According to a well-known conjectureD(ℋ)≧|ℋ|/(r−1+1/r). We prove a slightly stronger result. Let ℋ be anr-uniform, intersecting hypergraph. Then either it is a projective plane of orderr−1, consequentlyD(ℋ)=|ℋ|/(r−1+1/r), orD(ℋ)≧|ℋ|/(r−1). This is a corollary to… Expand
Finite projective spaces and intersecting hypergraphs
The results in this paper show that whereq is a prime power andn is sufficiently large, (n >n (k, c)) then the corresponding lower bound is given by the following construction. Expand
Transversals of d-Intervals
  • Tomás Kaiser
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1997
A method is presented which reduces a family of problems in combinatorial geometry to purely combinatorsial questions about hypergraphs and proves the tight bound on homogeneous d-intervals, which is linear in k. Expand
A generalization of Tuza's conjecture
It is shown that most known results on Tuza's conjecture go over to this more general setting, and some general results on the ratio are proved, including the fractional versions and the case of $k-partite hypergraphs. Expand
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 sinceExpand
On symmetric intersecting families
It is proved that a symmetric intersecting family of k-element subsets of 1,2, n of sets has size at most where $c > 0$ is a universal constant. Expand
Covers in partitioned intersecting hypergraphs
It is proved that if r 2 then t ( a � ) = r for every two components vector a � = ( a, b ) and that this conjecture is true whenever a � b , and also for a� = ( 2, 2 ) and a �= ( 4, 4 ) . Expand
On the Fractional Covering Number of Hypergraphs
It is shown (among other things) that for any rational $p/q\geqq 1$, there is a 3-uniform hypergraph H with $\tau* ( H ) = p/q$. Expand
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph
It is proved that for every?>0, if H is an intersectingk-uniform hypergraph in which no two edges share more thantcommon vertices, then the chromatic index of H is at most (t?1+1/t+?)D. Expand
Extremal hypergraphs for Ryser's Conjecture
The goal in this paper is to characterize those hypergraphs which are tight for Aharoni's Theorem and the characterization proves an old and wide open strengthening of Ryser's Conjecture for the 3-uniform extremal case, that is, forhypergraphs with τ = 2 ν . Expand
Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in termsExpand


On Intersecting Families of Finite Sets
  • P. Frankl
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1978
Whenever F is an extremal family the authors can find a 7-3 Steiner system B such that F consists exactly of those k -subsets of X which contain some member of B . Expand
Normal hypergraphs and the perfect graph conjecture
A hypergraph is called normal if the chromatic index of any partial hypergraph H' of it coincides with the maximum valency in H'. It is proved that a hypergraph is normal iff the maximum number ofExpand
Packing Problems and Hypergraph Theory: A Survey
This chapter focuses on a particular type of problems that arise in graph theory and in integer programming; though some of the results can be proved by purely algebraic methods and polytope properties, the “hypergraph” context permits a significant presentation that does not require a particular algebraic knowledge. Expand
Graph Theory and Integer Programming
This chapter discusses several most important results in integer programming that have been successfully applied to graph theory and then discusses those fields of graph theory where an integer-programming approach has been most effective. Expand
Graphs of diameter 2 and linear programming
Note: Professor Pach's number: [006] Reference DCG-CHAPTER-2008-043 Record created on 2008-12-08, modified on 2017-05-12
Combinatorial problems and exercises
Problems Hints Solutions Dictionary of the combinatorial phrases and concepts used Notation Index of the abbreviations of textbooks and monographs Subject index Author index Errata.
Erdős-ro-nado type theoÍems with upper bounds on the maximal degree, in: Algebraíc Methods in Graph Theory
  • Proc. Conf. Szeged 1978, L.Lovász et a|. eds,) ColI
  • 1981
Graph theory and integer programming, Annals of Discrete Math',z (|978) [tzj l. elcrr and L. SunÁNyi, Graphs of diameter 2 and linear programming
  • Algebraic Meth9ds in Graph TheoryProc. Conf. Szeged 1978, L,Lovász et al. eds.) Coll. Math. Soc. J' Bolyai
  • 1981
Combinatorial problems and exercises, Akadémiai Kiadó, Budapest-North-Ho1land
  • Combinatorial problems and exercises, Akadémiai Kiadó, Budapest-North-Ho1land
  • 1979
Ray-Cn,q,uonunt eds., Eypergraph Seminar
  • Quart, J. Math. Oxford
  • 1978