On the linear intersection number of graphs

Simple item page
dc.creatorKlein, Hauke
dc.creatorMargraf, Marian
dc.date2003-05-05
dc.date.accessioned2026-07-07T04:57:46Z
dc.date.available2026-07-07T04:57:46Z
dc.descriptionThe 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.
dc.description13 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0305073
dc.identifierhttp://arxiv.org/abs/math/0305073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67372
dc.subjectCombinatorics
dc.subject05C
dc.titleOn the linear intersection number of graphs
dc.typetext

Files

Collections

arXiv