Square critically 3-chromatic hypergraphs Original Research Article

A hypergraph is said to be square if the number of its vertices equals the number of its edges. It is said to be critically 3-chromatic, or 3-critical, if it has chromatic number 3, but every proper subgraph has a 2-coloring. We investigate a number of questions concerning square 3-critical hypergraphs.