A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs

10/23/2018
by   Charles Carlson, et al.
0

In this paper we study the problem of finding large cuts in K_r-free graphs with max degree d. We show that such graphs always have cuts which cut a 1/2+Ω(1/d^1-1/d^r-2) fraction of edges. This generalizes known results for K_3-free graphs. A key component of this result is showing that graphs with few triangles also have non-trivially good cuts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2021

Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree

Given a graph G of degree k over n vertices, we consider the problem of ...
research
09/22/2020

The Ising antiferromagnet and max cut on random regular graphs

The Ising antiferromagnet is an important statistical physics model with...
research
02/09/2021

Max-Cut via Kuramoto-type Oscillators

We consider the Max-Cut problem. Let G = (V,E) be a graph with adjacency...
research
06/03/2021

Oblivious Stacking and MAX k-CUT for Circle Graphs

Stacking is an important process within logistics. Some notable examples...
research
05/08/2019

Max-Cut in Degenerate H-Free Graphs

We obtain several lower bounds on the Max-Cut of d-degenerate H-free gra...
research
10/23/2022

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders

We show sublinear-time algorithms for Max Cut and Max E2Lin(q) on expand...
research
08/01/2022

An Approximate Generalization of the Okamura-Seymour Theorem

We consider the problem of multicommodity flows in planar graphs. Okamur...

Please sign up or login with your details

Forgot password? Click here to reset