While there have been many results on lower bounds for Max Cut in unweighted graphs, there are only few results for lower bounds for Max Cut in weighted graphs. In this paper, we launch an extensive study of lower bounds for Max Cut in weighted graphs. We introduce a new approach for obtaining lower bounds for Weighted Max Cut. Using it, Probabilistic Method, Vizing's chromatic index theorem, and other tools, we obtain several lower bounds for arbitrary weighted graphs, weighted graphs of bounded girth and triangle-free weighted graphs. We pose conjectures and open questions.
@article{arxiv.2104.05536,
title = {Lower Bounds for Maximum Weighted Cut},
author = {Gregory Gutin and Anders Yeo},
journal= {arXiv preprint arXiv:2104.05536},
year = {2024}
}