A graph theoretic proof of the fundamental trace identity
β Scribed by Hartmut Laue
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 200 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new proof is given for the independence of the termination of Kirby-Paris' Hydra Game from Peano Arithmetic by showing that it is strong enough to entail the termination of Gentzen's Reduction Strategy for proof ΓΏgures via an appropriate translation from derivations to hydras.
We show a natural graph-theoretic generalization of the Sauer-Shelah lemma. This result is applied to bound the & and L1 packing numbers of classes of functions whose range is an arbitrary, totally bounded metric space.
An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture