We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving a conjecture of Bonisoli and Cariolaro,Birkhauser, Basel, 2007, 73–84). Furthermore, we show the equivalence between the statement that 2r − 1 is the best possible upper bound for the cardinality of a minimum 1-factor cover of an r-graph and the well-known generalized Berge–Fulkerson conjecture.
An upper bound for the excessive index of an r-graph / Mazzuoccolo, Giuseppe. - In: JOURNAL OF GRAPH THEORY. - ISSN 0364-9024. - 73:4(2013), pp. 377-385. [10.1002/jgt.21682]
An upper bound for the excessive index of an r-graph
Mazzuoccolo, Giuseppe
2013
Abstract
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving a conjecture of Bonisoli and Cariolaro,Birkhauser, Basel, 2007, 73–84). Furthermore, we show the equivalence between the statement that 2r − 1 is the best possible upper bound for the cardinality of a minimum 1-factor cover of an r-graph and the well-known generalized Berge–Fulkerson conjecture.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
