Exact Numbers of Longest Cycles with Empty Intersection

Author： Jendrol S.   Skupien Z.  

Publisher： Academic Press

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.18, Iss.5, 1997-07, pp. : 575-578

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

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

Related content

Intersection and Linking Numbers in Oriented Matroids

By Carvalho Paula   Guedes de Oliveira António  

Discrete & Computational Geometry, Vol. 31, Iss. 2, 2004-02 ,pp. : 305-321 (17)

Springer Publishing Company

Access to resources Recommend Favorite

Empty Simplices of Polytopes and Graded Betti Numbers

By Nagel Uwe  

Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. : 389-410 (22)

Springer Publishing Company

Access to resources Recommend Favorite

COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES

By  

Bulletin of the Australian Mathematical Society, Vol. 85, Iss. 3, 2011-10 ,pp. : 415-421 (7)

Cambridge University Press

Access to resources Recommend Favorite

On the structure of 1-designs with at most two block intersection numbers

By Arhin John  

Designs, Codes and Cryptography, Vol. 43, Iss. 2-3, 2007-06 ,pp. : 103-114 (12)

Springer Publishing Company

Access to resources Recommend Favorite

Sets with few Intersection Numbers from Singer Subgroup Orbits

By Coykendall J.   Dover J.  

European Journal of Combinatorics, Vol. 22, Iss. 4, 2001-05 ,pp. : 455-464 (10)

Elsevier

Access to resources Recommend Favorite