The following pages link to (Q3838200):
Displaying 7 items.
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- On covering monotonic paths with simple random walk (Q2042653) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Monochromatic infinite paths (Q2366010) (← links)
- (Q3977492) (← links)