Document Zbl 0494.05045

Maximum degree and fractional matchings in uniform hypergraphs. (English) Zbl 0494.05045

Combinatorica 1, 155-162 (1981).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0494.05045

MSC:

05C65	Hypergraphs
05C35	Extremal problems in graph theory
05B25	Combinatorial aspects of finite geometries
05C70	Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Keywords:

uniform hypergraphs; intersecting hypergraphs; fractional transversal; projective planes; r-partite hypergraphs

Cite Review PDF

Full Text: DOI

References:

[1]	C. Berge, Packing problems and hypergraph theory: a survey,Annals of Discrete Math. 4. (1979), 3–37. · Zbl 0425.05017 · doi:10.1016/S0167-5060(08)70816-1
[2]	C. Berge andM. Simonovits, The coloring number of the direct product of two hypergraphs, in [3], 21–33. · Zbl 0321.05145
[3]	C. Berge andD. K. Ray-Chaudhuri eds.,Hypergraph Seminar 1972,Lecture Notes 411 (Springer-Verlag, Berlin, 1972).
[4]	B. Bollobás, Disjoint triples in a 3-graph with given maximal degree,Quart, J. Math. Oxford, Sec. Ser. 28 (1977), 81–87. · Zbl 0351.05118 · doi:10.1093/qmath/28.1.81
[5]	B. Bollobás andS. E. Eldridge, Maximal matchings in graphs with given minimal and maximal degrees,Math. Proc. Cambridge Phil. Soc. 79 (1976), 221–234. · Zbl 0353.05046 · doi:10.1017/S0305004100052233
[6]	P. Erdos,private communication.
[7]	P. Frankl, On intersecting families of finite sets,J. Combinatorial Th. (A) 24 (1978), 146–161. · Zbl 0384.05002 · doi:10.1016/0097-3165(78)90003-1
[8]	P. Frankl andZ. Füredi, Disjointr-tuples in anr-graph with given maximal degree, submitted toQuart, J. Math. Oxford.
[9]	Z. Füredi, Erdos–Ko–Rado type theorems with upper bounds on the maximal degree, in:Algebraic Methods in Graph Theory, (Proc. Conf. Szeged 1978, L. Lovász et al. eds.)Coll. Math. Soc. J. Bolyai 25, North-Holland 1981, to appear.
[10]	A. Gyárfás,to appear.
[11]	L. Lovász, Normal hypergraphs and the perfect graph conjecture,Discrete Math. 2 (1972), 253–267. · Zbl 0239.05111 · doi:10.1016/0012-365X(72)90006-4
[12]	L. Lovász,Combinatorial problems and exercises, Akadémiai Kiadó, Budapest–North-Holland, Amsterdam 1979.
[13]	L. Lovász, Minimax theorems for hypergraphs, in [3], 111–126.
[14]	L. Lovász, Doctoral thesis, Szeged 1977.
[15]	L. Lovász, On minimax theorems of combinatorics (in Hungarian)Matematikai Lapok 26 (1975), 209–264. · Zbl 0397.05040
[16]	L. Lovász, Graph theory and integer programming,Annals of Discrete Math.,2 (1978)
[17]	J. Pach andL. Surányi, Graphs of diameter 2 and linear programming, inAlgebraic Methods in Graph Theory, (Proc. Conf. Szeged 1978, L. Lovász et al. eds.)Coll. Math. Soc. J. Bolyai 25, North-Holland 1981, to appear.
[18]	J. Pelikán, Properties of balanced incomplete block designs, in:Combinatorial Theory and its Applications (P. Erdos, A. Rényi and V. T. Sós, eds.)Coll. Math. Soc. J. Bolyai 4, North-Holland 1971), 869–890.
[19]	Zs. Tuza, Some special cases of Ryser’s conjecture, to appear. · Zbl 0584.05042

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.