Pages that link to "Item:Q4920648"
From MaRDI portal
The following pages link to Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (Q4920648):
Displaying 12 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)
- Stability of extremal hypergraphs with applications to an edge-coloring problem (Q1689923) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Integer colorings with no rainbow \(k\)-term arithmetic progression (Q2143413) (← 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)
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
- Integer colorings with forbidden rainbow sums (Q6111260) (← links)
