Pages that link to "Item:Q510329"

The following pages link to Partitioning random graphs into monochromatic components (Q510329):

Displaying 11 items.

• Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
• Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
• Monochromatic trees in random graphs (Q1690004) (← links)
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
• Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
• Monochromatic partitions in local edge colorings (Q2220970) (← links)
• Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
• Monochromatic cycle partitions in random graphs (Q4993124) (← links)
• Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
• Covering random graphs with monochromatic trees (Q6074874) (← links)
• Large monochromatic components in colorings of complete hypergraphs (Q6126163) (← links)