Some graphic uses of an even number of odd nodes

Kathie Cameron, Jack Edmonds · Annales de l’institut Fourier · 1999

Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.

Read the paper · More papers on PaperTik