1 problem
forbidden-minor conjecture. The complete graph is a forbidden minor for reducibility with respect to the first Symanzik polynomial.
forbidden-minor conjecture. The complete graph is a forbidden minor for reducibility with respect to the first Symanzik polynomial.