New bounds for the -k-cut and chromatic number of a graph
From MaRDI portal
Publication:896848
DOI10.1016/J.LAA.2015.09.043zbMATH Open1326.05089arXiv1503.06595OpenAlexW1841503951MaRDI QIDQ896848FDOQ896848
Authors: Renata Sotirov, Edwin R. Van Dam 
Publication date: 14 December 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: We consider several semidefinite programming relaxations for the max--cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest Laplacian eigenvalue of the graph under consideration. This is the first known eigenvalue bound for the max--cut when that is applicable to any graph. This bound is exploited to derive a new eigenvalue bound on the chromatic number of a graph. For regular graphs, the new bound on the chromatic number is the same as the well-known Hoffman bound; however, the two bounds are incomparable in general. We prove that the eigenvalue bound for the max--cut is tight for several classes of graphs. We investigate the presented bounds for specific classes of graphs, such as walk-regular graphs, strongly regular graphs, and graphs from the Hamming association scheme.
Full work available at URL: https://arxiv.org/abs/1503.06595
Recommendations
- A class of spectral bounds for max \(k\)-cut
- scientific article; zbMATH DE number 4193718
- MAX k‐CUT and approximating the chromatic number of random graphs
- A lower bound for the chromatic number of a graph
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
semidefinite programmingchromatic numberstrongly regular graphsLaplacian eigenvaluesHamming graphsassociation schemes\(\max\)-\(k\)-cutwalk-regular graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A course in combinatorics.
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Problems in algebraic combinatorics
- Symmetry groups, semidefinite programs, and sums of squares
- Geometry of cuts and metrics
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- On the cut polytope
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Laplacian eigenvalues and the maximum cut problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On semidefinite programming relaxations of maximum \(k\)-section
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A comparison of the Delsarte and Lovász bounds
- Title not available (Why is that?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lower Bounds for the Partitioning of Graphs
- The partition problem
- Clique-Web Facets for Multicut Polytopes
- Title not available (Why is that?)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Feasibility conditions for the existence of walk-regular graphs
- Facets of the \(k\)-partition polytope
- Realignment in the National Football League: Did they do it right?
- Title not available (Why is that?)
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Solving the max-cut problem using eigenvalues
- Semidefinite programs and association schemes
- Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
- Bipartite Subgraphs and the Smallest Eigenvalue
- Polynomially Complete Fault Detection Problems
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- Title not available (Why is that?)
- Semidefinite relaxations for partitioning, assignment and ordering problems
- A remark on max-cut problem with an application to digital-analogue convertors
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
Cited In (14)
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs
- Max \(k\)-cut and the smallest eigenvalue
- Hamming graphs and special LCD codes
- Eigenvalues of Cayley graphs
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- A class of spectral bounds for max \(k\)-cut
- Projection results for the \(k\)-partition problem
- On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- A lower bound for the chromatic number of a graph
- New eigenvalue bound for the fractional chromatic number
- Max-cut and extendability of matchings in distance-regular graphs
Uses Software
This page was built for publication: New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896848)
