Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs

A mixed hypergraph H is a triple (X,C,D), where X is a finite set and each of C and D is a family of subsets of X. For any positive integer λ, a proper λ-coloring of H is an assignment of λ colors to vertices in H such that each member in C contains at least two vertices assigned the same color and each member in D contains at least two vertices assigned different colors. The chromatic polynomial of H is the graph-function counting the number of distinct proper λ-colorings of H whenever λ is a positive integer. In this article, we show that chromatic polynomials of mixed hypergraphs under certain conditions are zero-free in the intervals (−∞,0) and (0,1), which extends known results on zero-free intervals of chromatic polynomials of graphs and hypergraphs.

[1]  Ioan Tomescu.  On the chromaticity of sunflower hypergraphs SH(n, p, h) , 2007, Discret. Math..

[2]  Ioan Tomescu.  Sunflower hypergraphs are chromatically unique , 2004, Discret. Math..

[3]  Vitaly I. Voloshin,et al.  The mixed hypergraphs , 1993, Comput. Sci. J. Moldova.

[4]  Ruixue Zhang,et al.  Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs , 2016, Eur. J. Comb..

[5]  R. Read.  An introduction to chromatic polynomials , 1968 .

[6]  Douglas R. Woodall.  The largest real zero of the chromatic polynomial , 1997, Discret. Math..

[7]  Carsten Thomassen.  Chromatic Roots and Hamiltonian Paths , 2000, J. Comb. Theory, Ser. B.

[8]  Mieczyslaw Borowiecki,et al.  Chromatic polynomials of hypergraphs , 2006, Discuss. Math. Graph Theory.

[9]  Carsten Thomassen,et al.  The Zero-Free Intervals for Chromatic Polynomials of Graphs , 1997, Combinatorics, Probability and Computing.

[10]  G. Birkhoff.  A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[11]  Klaus Dohmen,et al.  A Broken-Circuits-Theorem for hypergraphs , 1995 .

[12]  Kinoshita Hirotsugu,et al.  Access Control Model for the Inference Attacks with Access Histories , 2017, 2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC).

[13]  N. Biggs.  Algebraic Graph Theory , 1974 .

[14]  Bill Jackson,et al.  Zeros of chromatic and flow polynomials of graphs , 2002, math/0205047.

[15]  Vitaly I. Voloshin,et al.  On the upper chromatic number of a hypergraph , 1995, Australas. J Comb..

[16]  V. Voloshin,et al.  Circular Mixed Hypergraphs I Colorability and Unique Colorability , 2013 .

[17]  Daniel Král.  Mixed hypergraphs and other coloring problems , 2007, Discret. Math..

[18]  V. Voloshin.  Coloring mixed hypergraphs : theory, algorithms and applications , 2002 .

[19]  Vitaly I. Voloshin,et al.  About uniquely colorable mixed hypertrees , 2000, Discuss. Math. Graph Theory.

[20]  Rhys Price Jones.  Colourings of hypergraphs , 1976 .

[21]  Alan D. Sokal,et al.  Chromatic Roots are Dense in the Whole Complex Plane , 2000, Combinatorics, Probability and Computing.

[22]  Ioan Tomescu,et al.  Chromatic Coefficients of Linear Uniform Hypergraphs , 1998, J. Comb. Theory, Ser. B.

[23]  Zsolt Tuza,et al.  Uncolorable Mixed Hypergraphs , 2000, Discret. Appl. Math..

[24]  D. Lewis.  CHROMATIC POLYNOMIALS , 2009 .

[25]  Bill Jackson,et al.  A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs , 2011, SIAM J. Discret. Math..

[26]  Feng Ming Dong,et al.  Zero-free intervals of chromatic polynomials of hypergraphs , 2020, Discret. Math..

[27]  H. Whitney.  A logical expansion in mathematics , 1932 .

[28]  Bill Jackson,et al.  A Zero-Free Interval for Chromatic Polynomials of Graphs , 1993, Combinatorics, Probability and Computing.

[29]  K. Koh,et al.  Chromatic polynomials and chro-maticity of graphs , 2005 .

[30]  Julian A. Allagan.  Chromatic Polynomials Of Some (m, l)-Hyperwheels , 2014, Comput. Sci. J. Moldova.

[31]  Siddhartha Sen,et al.  On the price of equivocation in byzantine agreement , 2012, PODC '12.

[32]  M. Halldórsson,et al.  Strong Colorings of Hypergraphs , 2004, WAOA.

[33]  Julian A. Allagan,et al.  Chromatic polynomials of some mixed hypergraphs , 2014, Australas. J Comb..

[34]  Manfred Walter.  Some Results on Chromatic Polynomials of Hypergraphs , 2009, Electron. J. Comb..

[35]  G. F. Royle.  Surveys in Combinatorics 2009: Recent results on chromatic and flow roots of graphs and matroids , 2009 .

[36]  Ioan Tomescu,et al.  Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs , 2009, Graphs Comb..

[37]  Ioan Tomescu.  Hypergraphs with Pendant Paths are not Chromatically Unique , 2014, Discuss. Math. Graph Theory.