Pages that link to "Item:Q5895162"

The following pages link to Colorings of hypergraphs with large number of colors (Q5895162):

Displayed 12 items.

• Colorings of \(b\)-simple hypergraphs (Q1689874) ‎ (← links)
• On the Erdős-Hajnal problem for 3-graphs (Q2027318) ‎ (← links)
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) ‎ (← links)
• On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) ‎ (← links)
• Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) ‎ (← links)
• Equitable colorings of hypergraphs with few edges (Q2309544) ‎ (← links)
• Equitable colorings of hypergraphs with \(r\) colors (Q2671950) ‎ (← links)
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) ‎ (← links)
• Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) ‎ (← links)
• Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) ‎ (← links)
• A General Framework for Hypergraph Coloring (Q5093586) ‎ (← links)
• Extremal problems in hypergraph colourings (Q5112450) ‎ (← links)