Pages that link to "Item:Q547872"

The following pages link to A structural result for hypergraphs with many restricted edge colorings (Q547872):

Displaying 17 items.

• Hypergraphs with many Kneser colorings (Q412274) (← links)
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
• A coloring problem for intersecting vector spaces (Q738847) (← links)
• Maximum number of sum-free colorings in finite abelian groups (Q1659538) (← links)
• Colourings without monochromatic disjoint pairs (Q1746571) (← links)
• Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← 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)
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size (Q2883863) (← links)
• A Rainbow Erdös--Rothschild Problem (Q4596826) (← links)
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (Q4920648) (← links)
• Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
• Stability for the Erdős-Rothschild problem (Q5887143) (← links)
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
• Integer colorings with forbidden rainbow sums (Q6111260) (← links)