On the linear intersection number of graphs
Combinatorics
2007-05-23 v1
Abstract
The celebrated Erdos, Faber and Lovasz conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an alternative formulation of the conjecture. Finally, first results about the linear intersection number will be proved. For example, we will determine all graphs with maximal linear intersection number given the number of edges of the graph.
Cite
@article{arxiv.math/0305073,
title = {On the linear intersection number of graphs},
author = {Hauke Klein and Marian Margraf},
journal= {arXiv preprint arXiv:math/0305073},
year = {2007}
}
Comments
13 pages, 3 figures