Edge splitting is a graph modification technique used to simplify complex graphs by dividing an edge into two or more edges with the introduction of new vertices. This method is often applied in network flow problems and graph algorithms to ensure certain properties, such as planarity or to facilitate easier computation of flows and paths.