Pages that link to "Item:Q1180794"

The following pages link to Covering \(t\)-element sets by partitions (Q1180794):

Displaying 11 items.

• Large monochromatic components in colorings of complete 3-uniform hypergraphs (Q1025935) (← links)
• Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
• Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
• Monochromatic partitions in local edge colorings (Q2220970) (← links)
• Size of monochromatic components in local edge colorings (Q2427524) (← links)
• Highly connected monochromatic subgraphs (Q2477397) (← links)
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
• Ramsey Problems for Berge Hypergraphs (Q5215899) (← links)
• Large monochromatic components in colorings of complete hypergraphs (Q6126163) (← links)
• Large monochromatic components in hypergraphs with large minimum codegree (Q6144911) (← links)
• Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)