Posts classified under: News

Given a graph G, a dominating set of G is a subset of vertices S such that every vertex not in S is adjacent to at least one vertex in S; that is, NG = V(G). While classical studies focus on finding the smallest dominating set of G, our focus shifts to finding the maximum … Continue reading Séminaire Algorithmique : « Packing many dominating sets in a graph », François Pirot (LISN, Univ. Paris-Saclay)

The Conforti–Cornuéjols conjecture has remained open for 36 years. In this talk, we present a criterion for a minimal counterexample to the Conforti–Cornuéjols conjecture. This talk is based on the following published paper: Bretto, Alain; Nasernejad, Mehrdad; Toledo, Jonathan. On the strong persistence property and normally torsion-freeness of square-free monomial ideals. Mediterr. J. Math. 22 … Continue reading Séminaire Algorithmique : « A criterion for a minimal counterexample to the Conforti–Cornuéjols conjecture », Mehrdad Nasernejad (GREYC, Caen)