2000 character limit reached
A Brooks' Theorem for Triangle-Free Graphs
Published 10 Jun 2011 in math.CO and cs.DM | (1106.1958v1)
Abstract: Let G be a triangle-free graph with maximum degree \delta(G). We show that the chromatic number \c{hi}(G) is less than 67(1 + o(1))\delta/ log \delta.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.