For a finite undirected graph G = (V, E) and a subset A β V , the vertex switching of G by A is defined as the graph G A = (V, E ), which is obtained from G by removing all edges between A and its complement A and adding as edges all nonedges between A and A. The switching class [G] determined by G
Types of acyclicity
β Scribed by A.K. Bousfield
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 541 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that a Tate construction A u1; : : : ; un | @(ui) = zi over a di erential graded algebra A, on cycles z1; : : : ; zn in A β₯1 , is acyclic if and only if the map of graded-commutative algebras H0(A)[y1; : : : ; yn] β H(A), with yi β cls(zi), is an isomorphism. This is used to establish that
Blair and Pollak (Econometrica (1982) 50: 931-943) prove that, if there are more alternatives than individuals, then, for every arrovian binary decision rule that is acyclic, there is at least one individual who has a veto power over a critical number of pairs of alternatives. If the number of indi
## Abstract For Abstract see ChemInform Abstract in Full Text.