Covering the complete graph by partitions

DOI10.1016/0012-365X(89)90088-5zbMATH Open0704.05018OpenAlexW1966866070MaRDI QIDQ916671FDOQ916671

Authors: Zoltán Füredi 

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

Recommendations

• scientific article; zbMATH DE number 4070935
• Vertex coverings by monochromatic cycles and trees
• On the partition and coloring of a graph by cliques
• Hypergraph coverings and local colorings
• Multicovering hypergraphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum degree and fractional matchings in uniform hypergraphs
• Finite projective spaces and intersecting hypergraphs
• On generalized Ramsey numbers for trees
• Ramsey numbers for the path with three edges
• On the Fractional Covering Number of Hypergraphs
• Weighted arcs, the finite Radon transform and a Ramsey problem
• Title not available (Why is that?)

Cited In (15)

• Partitions and well-coveredness: the graph sandwich problem
• Complete partitions of graphs
• Large monochromatic triple stars in edge colourings
• Complete partitions of graphs
• Bounding the pseudoachromatic index of the complete graph via projective planes
• Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
• Intersecting designs from linear programming and graphs of diameter two
• Matchings and covers in hypergraphs
• Covering \(t\)-element sets by partitions
• Restricted online Ramsey numbers of matchings and trees
• Monochromatic diameter-2 components in edge colorings of the complete graph
• Weighted arcs, the finite Radon transform and a Ramsey problem
• Acyclic graphoidal covers and path partitions in a graph
• On the pseudoachromatic index of the complete graph
• Large monochromatic components of small diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916671)