𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Average Minimum Size of a Manipulating Coalition

✍ Scribed by Geoffrey Pritchard; Arkadii Slinko

Publisher
Springer
Year
2006
Tongue
English
Weight
429 KB
Volume
27
Category
Article
ISSN
0176-1714

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Minimum Average Distance Spanning
On the Minimum Average Distance Spanning Tree of
✍ Maurice Tchuente; Paulin Melatagia Yonta; Jean-Michel Nlong; Yves Denneulin πŸ“‚ Article πŸ“… 2008 πŸ› Springer Netherlands 🌐 English βš– 492 KB
On the minimum size of visibility graphs
On the minimum size of visibility graphs
✍ Alfredo GarcΔ±́a Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 177 KB

In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the barvisibility graph of n disjoint line segments in the plane, according to their vertex-connectivity.

On the minimum size of tight hypergraphs
On the minimum size of tight hypergraphs
✍ Jorge L. Arocha; Javier Bracho; Victor Neumann-Lara πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract A __k__‐graph, __H__ = (__V, E__), is __tight__ if for every surjective mapping __f__: __V__ β†’ {1,….k} there exists an edge Ξ± Ο΅ __E__ sicj tjat __f__|~Ξ±~ is injective. Clearly, 2‐graphs are tight if and only if they are connected. Bounds for the minimum number Ο• of edges in a tight __k_