Covering the complete graph by partitions

DOI10.1016/0012-365X(89)90088-5zbMath0704.05018OpenAlexW1966866070MaRDI QIDQ916671

Zoltan Fueredi

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90088-5

zbMATH Keywords

finite projective planefinite affine planefractional matchingcover of hypergraphr-partite hypergraphr-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Large components in r-edge-colorings of Kn have diameter at most five ⋮ Large Monochromatic Triple Stars in Edge Colourings ⋮ Large monochromatic components of small diameter ⋮ Bounding the pseudoachromatic index of the complete graph via projective planes ⋮ Restricted online Ramsey numbers of matchings and trees ⋮ Weighted arcs, the finite Radon transform and a Ramsey problem ⋮ Covering \(t\)-element sets by partitions ⋮ Monochromatic diameter-2 components in edge colorings of the complete graph ⋮ On the pseudoachromatic index of the complete graph ⋮ Matchings and covers in hypergraphs ⋮ Intersecting designs from linear programming and graphs of diameter two

Cites Work

• On generalized Ramsey numbers for trees
• Ramsey numbers for the path with three edges
• Finite projective spaces and intersecting hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Weighted arcs, the finite Radon transform and a Ramsey problem
• On the Fractional Covering Number of Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering the complete graph by partitions