☆ 4.0 Article

Sum-of-squares certificates for Vizing's conjecture via determining Grobner bases

JOURNAL OF SYMBOLIC COMPUTATION (2024)

Related references

Note: Only part of the references are listed.

Article Computer Science, Theory & Methods

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares *,**

Elisabeth Gaar et al.

Summary: This paper formulates Vizing's conjecture as a mathematical question and uses methods such as semidefinite programming to obtain certificates, successfully confirming the conjecture for specific classes of graphs. This approach also applies to larger graph classes, providing possibilities for generalizing the conjecture.

JOURNAL OF SYMBOLIC COMPUTATION (2021)

Add to Collection

Article Mathematics

An Improved Bound in Vizing's Conjecture

Shira Zerbib

GRAPHS AND COMBINATORICS (2019)

Add to Collection

Article Mathematics

Vizing's conjecture: a survey and recent results

Bostjan Bresar et al.

JOURNAL OF GRAPH THEORY (2012)

Add to Collection

Article Mathematics, Applied

THETA BODIES FOR POLYNOMIAL IDEALS

Joao Gouveia et al.

SIAM JOURNAL ON OPTIMIZATION (2010)

Add to Collection

Article Computer Science, Theory & Methods

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz

J. A. Loera et al.

COMBINATORICS PROBABILITY & COMPUTING (2009)

Add to Collection

Article Mathematics

Algebraic characterization of uniquely vertex colorable graphs

Christopher J. Hillar et al.

JOURNAL OF COMBINATORIAL THEORY SERIES B (2008)

Add to Collection

Article Computer Science, Software Engineering

Semidefinite representations for finite varieties

Monique Laurent

MATHEMATICAL PROGRAMMING (2007)

Add to Collection

Article Mathematics

Nowhere-zero flow polynomials

S Onn

JOURNAL OF COMBINATORIAL THEORY SERIES A (2004)

Add to Collection

© Peeref 2019-2024. All rights reserved.