Recommendations
Cites work
- scientific article; zbMATH DE number 4070935 (Why is no real title available?)
- scientific article; zbMATH DE number 3506748 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- scientific article; zbMATH DE number 3334898 (Why is no real title available?)
- Finite projective spaces and intersecting hypergraphs
- Maximum degree and fractional matchings in uniform hypergraphs
- On generalized Ramsey numbers for trees
- On the Fractional Covering Number of Hypergraphs
- Ramsey numbers for the path with three edges
- Weighted arcs, the finite Radon transform and a Ramsey problem
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
- Matchings and covers in hypergraphs
- Covering \(t\)-element sets by partitions
- Intersecting designs from linear programming and graphs of diameter two
- 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)
