Abstract
For a graph G on n vertices with chromatic number χ ( G ) , the Nordhaus–Gaddum inequalities state that ⌈ 2 n ⌉ ≤ χ ( G ) + χ ( G ¯ ) ≤ n + 1 , and n ≤ χ ( G ) ⋅ χ ( G ¯ ) ≤ ⌊ ( n + 1 2 ) 2 ⌋ . Much analysis has been done to derive similar inequalities for other graph parameters, all of which are integer-valued. We determine here the optimal Nordhaus–Gaddum inequalities for the circular chromatic number and the fractional chromatic number, the first examples of Nordhaus–Gaddum inequalities where the graph parameters are rational-valued.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
