A collision in a hash table occurs when two keys hash to the same slot in the table. Hash functions are used to map keys to slots in the table, but since the range of possible keys is larger than the number of slots, collisions are inevitable. When a collision occurs, the hash table handles it using techniques like separate chaining or open addressing.