Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Fractional Aspects of the Erdős-Faber-Lovász Conjecture

John BosicaClaude Tardif — 2015

Discussiones Mathematicae Graph Theory

The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting pairwise in at most one vertex has chromatic number n. Kahn and Seymour proved a fractional version of this conjecture, where the chromatic number is replaced by the fractional chromatic number. In this note we investigate similar fractional relaxations of the Erdős-Faber-Lovász conjecture, involving variations of the fractional chromatic number. We exhibit some relaxations that...

Page 1

Download Results (CSV)