DeepAI AI Chat
Log In Sign Up

Lower Bounds for Maximum Weighted Cut

by   Gregory Gutin, et al.

While there have been many results on lower bounds for Max Cut in unweighted graphs, the only lower bound for non-integer weights is that by Poljak and Turzik (1986). 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.


page 1

page 2

page 3

page 4


Max-Cut in Degenerate H-Free Graphs

We obtain several lower bounds on the Max-Cut of d-degenerate H-free gra...

Automated Lower Bounds on the I/O Complexity of Computation Graphs

We consider the problem of finding lower bounds on the I/O complexity of...

Approximate Inference via Weighted Rademacher Complexity

Rademacher complexity is often used to characterize the learnability of ...

Lower bounds on the number of realizations of rigid graphs

In this paper we take advantage of a recently published algorithm for co...

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

We present an integer programming model to compute the strong rainbow co...

Lower bounds in multiple testing: A framework based on derandomized proxies

The large bulk of work in multiple testing has focused on specifying pro...

Upper and Lower Bounds for Deterministic Approximate Objects

Relaxing the sequential specification of shared objects has been propose...