Covering \(t\)-element sets by partitions
From MaRDI portal
Publication:1180794
DOI10.1016/S0195-6698(13)80099-6zbMath0758.05008MaRDI QIDQ1180794
Zoltan Fueredi, András Gyárfás
Publication date: 27 June 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Partitions of sets (05A18) Hypergraphs (05C65) Combinatorial inequalities (05A20) Blocking sets, ovals, (k)-arcs (51E21) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10) Combinatorial aspects of packing and covering (05B40)
Related Items
Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Large monochromatic components in hypergraphs with large minimum codegree ⋮ Size of monochromatic components in local edge colorings ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Monochromatic partitions in local edge colorings ⋮ Highly connected monochromatic subgraphs ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Large monochromatic components in colorings of complete 3-uniform hypergraphs ⋮ Intersecting designs from linear programming and graphs of diameter two
Cites Work
- Unnamed Item
- Unnamed Item
- Covering the complete graph by partitions
- On generalized Ramsey numbers for trees
- t-expansive and t-wise intersecting hypergraphs
- Finite projective spaces and intersecting hypergraphs
- Maximum degree and fractional matchings in uniform hypergraphs
- Matchings and covers in hypergraphs
