fractional covering
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Robert Šámal

International audience We introduce a new graph parameter 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 cliques play for the chromatic number and Kneser graphs for the fractional chromatic number. The fact that the defined parameter attains on these graphs the correct value suggests that our definition is a natural one. In the proof we use the eigenvalue bound for maximum cut and a recent result of Engström, Färnqvist, Jonsson, and Thapper [An approximability-related parameter on graphs – properties and applications, DMTCS vol. 17:1, 2015, 33–66]. 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]).


2012 ◽  
Vol 33 (5) ◽  
pp. 799-806 ◽  
Author(s):  
Penny Haxell ◽  
Alexandr Kostochka ◽  
Stéphan Thomassé

2005 ◽  
Vol 22 ◽  
pp. 455-459 ◽  
Author(s):  
Robert Šámal
Keyword(s):  

1988 ◽  
Vol 1 (1) ◽  
pp. 45-49 ◽  
Author(s):  
F. R. K. Chung ◽  
Z. Füredi ◽  
M. R. Garey ◽  
R. L. Graham

Sign in / Sign up

Export Citation Format

Share Document