Euler’s Theorem for Regular CW-Complexes

IF 1 2区数学 Q1 MATHEMATICS

Combinatorica Pub Date : 2024-01-05 DOI:10.1007/s00493-023-00080-1

Richard H. Hammack, Paul C. Kainen

引用次数: 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.

Abstract Image

查看原文本刊更多论文

正规 CW 复数的欧拉定理

对于强连接的纯 n 维正则 CW 复合物，我们证明了偶数性（每个 \((n{-}1)\) 单元包含在偶数个 n 单元中）等同于循环分解和可遍历性的广义化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： 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.