Pages that link to "Item:Q412274"

The following pages link to Hypergraphs with many Kneser colorings (Q412274):

Displaying 20 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)
• The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
• Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
• Maximum number of sum-free colorings in finite abelian groups (Q1659538) (← links)
• Colourings without monochromatic disjoint pairs (Q1746571) (← links)
• Integer colorings with no rainbow 3-term arithmetic progression (Q2138586) (← links)
• A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
• Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
• Kneser colorings of uniform hypergraphs (Q2851466) (← links)
• Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (Q2857389) (← links)
• An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
• Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
• Integer colorings with forbidden rainbow sums (Q6111260) (← links)