Cubical coloring -- fractional covering by cuts and semidefinite programming

Details Cubical coloring -- fractional covering by cuts and semidefinite programming Cubical coloring -- fractional covering by cuts and semidefinite programming

2009-11-13

arxiv.org/abs/0911.2589v2

Mathematics

Combinatorics

15 pages

Scientific paper

We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with chromatic number, bipartite density, and other graph parameters. We find the value of our parameter for a family of graphs based on hypercubes. These graphs play for our parameter the role that circular cliques play for the circular chromatic number. The fact that the defined parameter attains on these graphs the `correct' value suggests that the definition is a natural one. In the proof we use the eigenvalue bound for maximum cut and a recent result of Engstr\"om, F\"arnqvist, Jonsson, and Thapper. We also provide a polynomial time approximation algorithm based on semidefinite programming and in particular on vector chromatic number (defined by Karger, Motwani and Sudan [Approximate graph coloring by semidefinite programming, J. ACM 45 (1998), no. 2, 246--265]).

Affiliated with

Also associated with

No associations

Rating

Cubical coloring -- fractional covering by cuts and semidefinite programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cubical coloring -- fractional covering by cuts and semidefinite programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cubical coloring -- fractional covering by cuts and semidefinite programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149637