Exact Numbers of Longest Cycles with Empty Intersection

We have proved that, for every integerν≥7,there is a 2-connected graph havingνlongest cycles the intersection of which is empty, but any set ofν-1longest cycles has a non-empty intersection. This implies a new bound,c≤6,on a parametercintroduced by T. Zamfirescu.