𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Fractional Chromatic Number Of The Categorical Product Of Graphs

✍ Scribed by Claude Tardif

Book ID
106167570
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
159 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The fractional chromatic number of infin
The fractional chromatic number of infinite graphs
✍ Imre Leader πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 398 KB πŸ‘ 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g

The fractional chromatic number of Zykov
The fractional chromatic number of Zykov products of graphs
✍ Pierre Charbit; Jean SΓ©bastien Sereni πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 229 KB

Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of a family of graphs. As a corollary, we deduce that the fractional chromatic numbers of the Zykov graphs satisfy the sam

The fractional chromatic number of mycie
The fractional chromatic number of mycielski's graphs
✍ Michael Larsen; James Propp; Daniel Ullman πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 236 KB

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, of triangle-free graphs with ,y(G,) = n. In this article, w e calculate the fractional chromatic number of G, and show that this sequence of num