D. Kleitman, A. Martin-Löf, B. Rothschild , A. Whinston
{"title":"A matching theorem for graphs","authors":"D. Kleitman, A. Martin-Löf, B. Rothschild , A. Whinston","doi":"10.1016/S0021-9800(70)80013-8","DOIUrl":null,"url":null,"abstract":"<div><p>Let the vertices of an undirected graph be given labels 1, 2, …, <em>n</em>, 1′, 2′, …, <em>n</em>′ such that each vertex has at least <em>n</em>−1 different labels without both <em>i</em> and <em>i</em>′ for any <em>i</em>. Then among all paths between a vertex labeled <em>i</em> and a vertex labeled <em>i</em>′ for any <em>i</em>, the maximum number which are mutually edge disjoint equals the minimum size of an edge cut-set separating all vertices labeled <em>i</em> from all those labeled <em>i</em>′ for any <em>i</em>.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 104-114"},"PeriodicalIF":0.0000,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80013-8","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Let the vertices of an undirected graph be given labels 1, 2, …, n, 1′, 2′, …, n′ such that each vertex has at least n−1 different labels without both i and i′ for any i. Then among all paths between a vertex labeled i and a vertex labeled i′ for any i, the maximum number which are mutually edge disjoint equals the minimum size of an edge cut-set separating all vertices labeled i from all those labeled i′ for any i.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
