Pages that link to "Item:Q2883863"

The following pages link to Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size (Q2883863):

Displaying 15 items.

• Hypergraphs with many Kneser colorings (Q412274) (← links)
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
• Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
• Colourings without monochromatic disjoint pairs (Q1746571) (← links)
• Edge colorings of graphs without monochromatic stars (Q2005736) (← links)
• Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
• On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696) (← links)
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
• On the maximum number of integer colourings with forbidden monochromatic sums (Q2662340) (← links)
• (Q2857389) (← links)
• An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
• Stability for the Erdős-Rothschild problem (Q5887143) (← links)
• Integer colorings with forbidden rainbow sums (Q6111260) (← links)