Intersections and unions of critical independent sets in bipartite graphs

Vadim E. Levit, Eugen Mandrescu

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Let G be a simple graph with vertex set V (G), and let Ind(G) denote the family of all independent sets of G. The number d (X) = |X| - |N(X)| is the difference of X ⊆ V (G), and a set A ∈ Ind(G) is critical whenever d(A) = max{d (I): I ∈ Ind(G)} [10]. In this paper we establish various relations between intersections and unions of all critical independent sets of a bipartite graph in terms of its bipartition.

Original languageEnglish
Pages (from-to)257-260
Number of pages4
JournalBulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie
Issue number3
StatePublished - 2016


  • Core
  • Critical set
  • Diadem
  • Independent set
  • Ker


Dive into the research topics of 'Intersections and unions of critical independent sets in bipartite graphs'. Together they form a unique fingerprint.

Cite this