The following pages link to (Q4068746):
Displaying 10 items.
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
- Partition Critical Hypergraphs (Q2851519) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
