An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

DOI10.1145/3326229.3326239zbMath1444.68303arXiv1901.10288OpenAlexW2958171774MaRDI QIDQ5120487

Angelika Wiegele, Elisabeth Gaar, Susan Margulies, Daniel Krenn

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.10288

zbMATH Keywords

Gröbner basissemidefinite programmingVizing's conjecturealgebraic modelsum-of-squares problems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (3)

Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares

This page was built for publication: An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture