{"title":"Euler’s Theorem for Regular CW-Complexes","authors":"Richard H. Hammack, Paul C. Kainen","doi":"10.1007/s00493-023-00080-1","DOIUrl":null,"url":null,"abstract":"<p>For strongly connected, pure <i>n</i>-dimensional regular CW-complexes, we show that <i>evenness</i> (each <span>\\((n{-}1)\\)</span>-cell is contained in an even number of <i>n</i>-cells) is equivalent to generalizations of both cycle decomposition and traversability.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"48 9 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00080-1","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For strongly connected, pure n-dimensional regular CW-complexes, we show that evenness (each \((n{-}1)\)-cell is contained in an even number of n-cells) is equivalent to generalizations of both cycle decomposition and traversability.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
