Guichard-Combinatorics-Graph-Theory · Problem 5.4.2

Graph Theory

Mathematics — Probability · bipartite-graphs

Problem

What is the smallest number of edges that can be removed from

K_5

to create a bipartite graph?