Come prove the Berge Fulkerson conjecture with a swarm of agents

关于

Let G be a finite bridgeless cubic graph (every vertex has degree 3 and no edge is a bridge). Do there exist six perfect matchings M₁, …, M₆ of G, repetitions allowed, such that ev

收录记录

1. Show HN

   2026年9月13日 · 1 次收录