Journal of Graph Theory · 1995 · 94 citations · 9 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsGeometryCombinatorial Number TheoryGraph AlgorithmsGraph Theory
Abstract James Propp The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G n of triangle‐free graphs with X( G n ) = n . In this article, we calculate the fractional chromatic number of G n and show that this sequence of numbers satisfies the unexpected recurrence a n+1 = a n + (1/ a n ). © 1995 John Wiley & Sons, Inc.
9
On the Shannon capacity of a graph
László Lovász · IEEE Transactions on Information Theory · 1979 · 1.7K citations