𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence conditions for consensus n-trees revisited

✍ Scribed by Jean-Pierre Barthélemy; F.R. McMorris; R.C. Powers

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
310 KB
Volume
4
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an independence condition for consens
On an independence condition for consensus n-trees
✍ Jean-Pierre Barthelemy; F.R. McMorris 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 308 KB

## Ternary independence for a consensus function is introduced and used to prove a version of Arrow's theorem' for n-trees.

Intersection rules for consensus n-trees
Intersection rules for consensus n-trees
✍ R.C. Powers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 304 KB

We prove a theorem that offers an axiomatic characterization of a class of generalized intersection rules for consensus n-trees. By modifying one of the axioms, there is a corresponding result for the Adams consensus rule.

The independence number condition for th
The independence number condition for the existence of a spanning f-tree
✍ Hikoe Enomoto; Kenta Ozeki 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

## Abstract Let __G__ be a graph and __f__ be a mapping from __V__(__G__) to the positive integers. A subgraph __T__ of __G__ is called an __f__‐tree if __T__ forms a tree and __d__~__T__~(__x__)≤__f__(__x__) for any __x__∈__V__(__T__). We propose a conjecture on the existence of a spanning __f__‐t