1 problem
Let be an integer and let be a -graph, meaning a graph in which every vertex has degree . The odd-regular flow conjecture. Every such graph satisfies … The…
Let be an integer and let be a -graph, meaning a graph in which every vertex has degree . The odd-regular flow conjecture. Every such graph satisfies … The…