Dmitriy Mokeev (NRU HSE & NRU Lobachevsky State University of Nizhni Novgorod) will give a lecture "On the equality of matching number and vertex covering number in the F-structure of graphs (second part)" at the laboratory seminar
Event ended
In this talk we consider the cases when both a matching number and a vertex covering number are equal for different F-structure of graphs. Known and new results will be presented.
- F-structure of graph G is a hypergraph H on the vertex set of G whose hyperedges are the vertex subsets inducing subgraphs isomorphic graphs of F.
- Matching in the F-structure is a set of its pairwise disjoint hyperedges.
- Vertex cover in the F-structure is a set of its vertices that each hyperedge in F contains at least one of them.
- In any F-structure of any graph of maximum size of matching (matching number) is less or equal than minimum size of vertex cover (covering number).
Place: 136, Rodionova St., room №401.
All are invited!
Date
17 December
15:00