{"title":"具有规定价的子图","authors":"László Lovász","doi":"10.1016/S0021-9800(70)80033-3","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper a generalization of the factor problem for finite undirected graphs is detailed. We prescribe certain inequalities for the valencies of a subgraph. We deduce formulas for the minimum “deviation” of this prescription and characterize the “optimally approaching” subgraphs. These results include the conditions of Tutte and Ore for the existence of a factor and the characterization of maximal independent edge-systems given in [3] and [11].</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 4","pages":"Pages 391-416"},"PeriodicalIF":0.0000,"publicationDate":"1970-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80033-3","citationCount":"131","resultStr":"{\"title\":\"Subgraphs with prescribed valencies\",\"authors\":\"László Lovász\",\"doi\":\"10.1016/S0021-9800(70)80033-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper a generalization of the factor problem for finite undirected graphs is detailed. We prescribe certain inequalities for the valencies of a subgraph. We deduce formulas for the minimum “deviation” of this prescription and characterize the “optimally approaching” subgraphs. These results include the conditions of Tutte and Ore for the existence of a factor and the characterization of maximal independent edge-systems given in [3] and [11].</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 4\",\"pages\":\"Pages 391-416\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80033-3\",\"citationCount\":\"131\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800333\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper a generalization of the factor problem for finite undirected graphs is detailed. We prescribe certain inequalities for the valencies of a subgraph. We deduce formulas for the minimum “deviation” of this prescription and characterize the “optimally approaching” subgraphs. These results include the conditions of Tutte and Ore for the existence of a factor and the characterization of maximal independent edge-systems given in [3] and [11].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
