Pages that link to "Item:Q5451060"
From MaRDI portal
The following pages link to Extremal problems for colourings of uniform hypergraphs (Q5451060):
Displaying 22 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- On the vertex number of almost bipartite hypergraphs (Q492430) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299) (← links)
- On balanced colorings of hypergraphs (Q548768) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails (Q2065902) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← 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)
- Extremal \(n\)-systems of sets (Q2737124) (← links)
- On a generalization of Rubin's theorem (Q3018075) (← links)
- On Some Extremal Properties of Hypergraph Colorings (Q3503457) (← links)
- (Q3784094) (← links)
- On construction hypergraphs without property \(B\) (Q3974687) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- (Q5749309) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
