In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by three colors without two edges of the same color meeting at a point.
Maybe the make black holes or something. Apparently we almost got hit by an asteroid today.