Pages that link to "Item:Q5028797"
From MaRDI portal
The following pages link to Covering complete graphs by monochromatically bounded sets (Q5028797):
Displaying 7 items.
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Monochromatic diameter-2 components in edge colorings of the complete graph (Q2233352) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five (Q2891044) (← links)
- (Q3977492) (← links)
- Large monochromatic components of small diameter (Q6056809) (← links)