Author:
Kriel Christo,Mphako-Banda Eunice
Abstract
We show that the problem of counting the number of flats of size k for a cycle matroid of a complete graph is equivalent to the problem of counting the number of partitions of an integer k into triangular numbers. In addition, we give some values of k such that there is no flat of size k in a cycle matroid of a complete graph of order k. Finally, we give a minimum bound for the number of values, k, for which there are no flats of size k in the given cycle matroid.
Publisher
Universidad Nacional de Colombia
Reference6 articles.
1. G. E. Andrews, Eureka! num = A+A+A, Journal of Number Theory and Technology 23 (1986), 285-293.
2. G. E. Andrews and K. Eriksson, Integer Partitions, Cambridge University Press, Cambridge, 2004.
3. L. E. Dickson, History of the Theory of Numbers, volume 2, Chelsea Publishing Company, New York, 1971.
4. E. G. Mphako, Tutte Polynomials of Perfect Matroid Designs, Combinatorics, Probability and Computing 9 (2000), 363-367.
5. J. G. Oxley, Matroid Theory, Oxford University Press, Oxford, 1992.