Robust independence systems

Naonori Kakimura, Kazuhisa Makino

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids. We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number α > 0, a set X ∈ F is said to be α-robust if for any k, it includes an α-approximation of the maximum k-independent set, where a set Y in F is called k-independent if the size |Y

Original languageEnglish
Pages (from-to)1257-1273
Number of pages17
JournalSIAM Journal on Discrete Mathematics
Issue number3
Publication statusPublished - 2013 Nov 25
Externally publishedYes


  • Exchangeability
  • Independence systems
  • Matroids
  • Robustness

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Robust independence systems'. Together they form a unique fingerprint.

Cite this