{"title":"关于Gallai猜想的紧界","authors":"Jun-ming Gao, Jie Ma","doi":"10.1007/s00493-023-00020-z","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"1 1","pages":"1-7"},"PeriodicalIF":1.0000,"publicationDate":"2022-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Tight Bounds Towards a Conjecture of Gallai\",\"authors\":\"Jun-ming Gao, Jie Ma\",\"doi\":\"10.1007/s00493-023-00020-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":\"1 1\",\"pages\":\"1-7\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-023-00020-z\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00020-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.