No label defined (Q3736458)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3969536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3969536 |
Statements
1985
0 references
graphs of d-polytopes
0 references
simple d-polytope
0 references
cycles
0 references
conjecture of Perles
0 references
combinatorially equivalent
0 references
0.8600446581840515
0 references
0.8167071342468262
0 references
0.7977098822593689
0 references
[For the entire collection see Zbl 0588.00010.] There are considered the graphs of d-polytopes (d\(\geq 3)\). If a d- polytope has only 2-faces with an even number of edges, then the graph of such a d-polytope is bipartite. If such a d-polytope is also simple, then its graph has a set of edges which consists of d edge-disjoint perfect matchings. The graph of a simple d-polytope is regular of degree d. It contains a system K of special elementary cycles, which correspond to the polygons of the boundaries of 2-faces. Properties of the cycles of K are regarded. For example no cycle of K has a chord and every cycle of the graph with length less or equal five is a cycle of K. No cycle of K has a contact vertex. That is a vertex, which does not belong to the cycle and which is adjacent to at least two consecutive vertices of the cycle. Furthermore an idea is developed, to prove the conjecture of Perles in the special case \(d=4\), that two simple 4-polytopes with isomorphic graphs are combinatorially equivalent.
0 references