Graph Imperfection II

The imperfection ratio is a graph invariant which indicates how good a lower bound the weighted clique number gives on the weighted chromatic number, in the limit as weights get large. Its introduction was motivated by investigations of the radio channel assignment problem, where one has to assign channels to transmitters and the demands for channels at some transmitters are large. In this paper we show that the imperfection ratio behaves multiplicatively under taking the lexicographic product, which permits us to identify its possible values, investigate its extremal behaviour and its behaviour on random graphs, explore three upper bounds, and show that it is NP-hard to determine.

[1]  P. Erdős.  Some remarks on chromatic graphs , 1967 .

[2]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[3]  Tomasz Luczak.  The chromatic number of random graphs , 1991, Comb..

[4]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[5]  Jeong Han Kim,et al.  The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[6]  Alan M. Frieze,et al.  On the independence and chromatic numbers of random regular graphs , 1992, J. Comb. Theory, Ser. B.

[7]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[10]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[11]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[12]  Béla Bollobás,et al.  The independence ratio of regular graphs , 1981 .

[13]  Alan M. Frieze,et al.  On the independence number of random graphs , 1990, Discret. Math..

[14]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[15]  Béla Bollobás,et al.  Random Graphs , 1985 .

[16]  Noga Alon,et al.  Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..

[17]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[18]  Colin McDiarmid,et al.  Graph Imperfection , 2001, J. Comb. Theory, Ser. B.

[19]  C. Berge.  Fractional Graph Theory , 1978 .