On the linear intersection number of graphs

Details On the linear intersection number of graphs On the linear intersection number of graphs

2003-05-05

arxiv.org/abs/math/0305073v1

Mathematics

Combinatorics

13 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the linear intersection number of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the linear intersection number of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the linear intersection number of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41480