Matroid Representation of Clique Complexes

  • Kenji Kashiwabara
  • Yoshio Okamoto
  • Takeaki Uno
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2697)


In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) and investigate the minimum number k such that the clique complex of a given graph can be represented as the intersection of k matroids. This number k can be regarded as a measure of “how complex a graph is with respect to the maximum weighted clique problem” since a greedy algorithm is a k-approximation algorithm for this problem. We characterize graphs whose clique complexes can be represented as the intersection of k matroids for any k > 0. Moreover, we determine the necessary and sufficient number of matroids for the representation of all graphs with n vertices. This number turns out to be n − 1. Other related investigations are also given.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Cai, D. Corneil and A. Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21 (1996) 267–287.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    R. Diestel: Graph Theory (2nd Edition). Springer Verlag, New York, 2000.Google Scholar
  3. 3.
    J. Edmonds: Matroids and the greedy algorithm. Mathematical Programming 1 (1971) 127–136.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    U. Faigle: Matroids in combinatorial optimization. In: Combinatorial Geometries (N. White, ed.), Cambridge University Press, Cambridge, 1987, pp. 161–210.Google Scholar
  5. 5.
    S.P. Fekete, R.T. Firla and B. Spille: Characterizing matchings as the intersection of matroids. Preprint, December 2002, arXiv:math.CO/0212235.Google Scholar
  6. 6.
    A. Frank: A weighted matroid intersection algorithm. Journal of Algorithms 2 (1981) 328–336.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    T.A. Jenkyns: The efficacy of the “greedy” algorithm. Proceedings of the 7th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, 1976, pp. 341–350.Google Scholar
  8. 8.
    B. Korte and D. Hausmann: An analysis of the greedy algorithm for independence systems. In: Algorithmic Aspects of Combinatorics; Annals of Discrete Mathematic 2 (B. Alspach et al., eds.), North-Holland, Amsterdam, 1978, pp. 65–74.CrossRefGoogle Scholar
  9. 9.
    B. Korte and J. Vygen: Combinatorial Optimization (2nd Edition). Springer Verlag, Berlin Heidelberg, 2002.zbMATHGoogle Scholar
  10. 10.
    Y. Okamoto: Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research 58 (2003), to appear.Google Scholar
  11. 11.
    J. Oxley: Matroid Theory. Oxford University Press, New York, 1992.zbMATHGoogle Scholar
  12. 12.
    F. Protti and J.L. Szwarcfiter: Clique-inverse graphs of bipartite graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 40 (2002) 193–203.zbMATHMathSciNetGoogle Scholar
  13. 13.
    R. Rado: Note on independence functions. Proceedings of the London Mathematical Society 7 (1957) 300–320.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kenji Kashiwabara
    • 1
  • Yoshio Okamoto
    • 2
  • Takeaki Uno
    • 3
  1. 1.Department of Systems Science, Graduate School of Arts and SciencesThe University of TokyoTokyoJapan
  2. 2.Institute of Theoretical Computer Science, Department of Computer ScienceETH Zurich, ETH ZentrumZurichSwitzerland
  3. 3.National Institute of InformaticsTokyoJapan

Personalised recommendations