placeholder

Hasnain says:

“From our party game we know that, given a set of vertices, it’s not always possible to form an odd graph. But it is always possible to form an odd subgraph. One boring way to accomplish this is to do what we did above: Just pick two vertices that connect to each other and ignore all their other edges. That makes an odd subgraph, but a very small one. Is it always possible to find a large odd subgraph?”

Posted on 2022-03-29T05:07:03+0000