一般图中障碍族的一个标准刻画
A Canonical Characterization of the Family of Barriers in General Graphs
摘要：
给定一个图，障碍是由Berge公式确定的一组顶点--最小-最大定理表征最大匹配的大小。障碍的概念在匹配理论的许多上下文中起着重要的作用，因为障碍本质上与最大匹配问题的对偶最优解相一致。在一类特殊的图中，称为基本图，极大障碍族形成顶点的划分;这种划分是由Lovász发现的，称为典型划分。正则划分在匹配理论中产生了许多基本结果，如双耳定理。然而，在非基本图中，极大障碍族从来不形成划分，并且还没有一般图的标准划分。在本文中，利用我们以前的工作，我们给出了一个典型的描述结构的奇极大障碍--一类障碍，包括最大障碍-一般图，我们还揭示了结构的奇组件与奇极大障碍。我们的这一结果可以看作是Lovász典型划分的推广。
英文摘要：
Given a graph, a barrier is a set of vertices determined by the Berge formula---the min-max theorem characterizing the size of maximum matchings. The notion of barriers plays important roles in numerous contexts of matching theory, since barriers essentially coincides with dual optimal solutions of the maximum matching problem. In a special class of graphs called the elementary graphs, the family of maximal barriers forms a partition of the vertices; this partition was found by Lovász and is called the canonical partition. The canonical partition has produced many fundamental results in matching theory, such as the two ear theorem. However, in non-elementary graphs, the family of maximal barriers never forms a partition, and there has not been the canonical partition for general graphs. In this paper, using our previous work, we give a canonical description of structures of the odd-maximal barriers---a class of barriers including the maximal barriers---for general graphs; we also reveal structures of odd components associated with odd-maximal barriers. This result of us can be regarded as a generalization of Lovász's canonical partition.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
