Home » News » seminar » Dong Yeap Kang (강동엽) gave a talk on the existence of a largest possible matching in a random subhypergraph of a k-uniform hypergraph with the codegree condition at the Discrete Math Seminar

Dong Yeap Kang (강동엽) gave a talk on the existence of a largest possible matching in a random subhypergraph of a k-uniform hypergraph with the codegree condition at the Discrete Math Seminar