{"title":"关于团值恒等式和曼特型定理","authors":"H. T. Faal","doi":"10.22108/TOC.2020.119553.1680","DOIUrl":null,"url":null,"abstract":"In this paper, we first extend the weighted handshaking lemma, using a generalization of the concept of the degree of vertices to the values of graphs. This edge-version of the weighted handshaking lemma yields an immediate generalization of the Mantel's classical result which asks for the maximum number of edges in triangle-free graphs to the class of $K_{4}$-free graphs. Then, by defining the concept of value for cliques (complete subgraphs) of higher orders, we also extend the classical result of Mantel for any graph $G$. We finally conclude our paper with a discussion about the possible future works.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"9 1","pages":"139-146"},"PeriodicalIF":0.6000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On clique values identities and mantel-type theorems\",\"authors\":\"H. T. Faal\",\"doi\":\"10.22108/TOC.2020.119553.1680\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we first extend the weighted handshaking lemma, using a generalization of the concept of the degree of vertices to the values of graphs. This edge-version of the weighted handshaking lemma yields an immediate generalization of the Mantel's classical result which asks for the maximum number of edges in triangle-free graphs to the class of $K_{4}$-free graphs. Then, by defining the concept of value for cliques (complete subgraphs) of higher orders, we also extend the classical result of Mantel for any graph $G$. We finally conclude our paper with a discussion about the possible future works.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"9 1\",\"pages\":\"139-146\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2020.119553.1680\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2020.119553.1680","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
On clique values identities and mantel-type theorems
In this paper, we first extend the weighted handshaking lemma, using a generalization of the concept of the degree of vertices to the values of graphs. This edge-version of the weighted handshaking lemma yields an immediate generalization of the Mantel's classical result which asks for the maximum number of edges in triangle-free graphs to the class of $K_{4}$-free graphs. Then, by defining the concept of value for cliques (complete subgraphs) of higher orders, we also extend the classical result of Mantel for any graph $G$. We finally conclude our paper with a discussion about the possible future works.