Pages that link to "Item:Q472979"
From MaRDI portal
The following pages link to Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979):
Displaying 17 items.
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- A structural result for hypergraphs with many restricted edge colorings (Q547872) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← 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)
- Kneser colorings of uniform hypergraphs (Q2851466) (← links)
- Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (Q2857389) (← links)
- Edge colourings of graphs avoiding monochromatic matchings of a given size (Q2883863) (← links)
- A problem on complements and disjoint edges in hypergraph (Q3900108) (← links)
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) (← links)
- Integer colorings with forbidden rainbow sums (Q6111260) (← links)