𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of representation of graphs by set systems

✍ Scribed by Svatopluk Poljak; Vojtěch Rödl; Daniel Turzík

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
568 KB
Volume
3
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On set intersection representations of g
On set intersection representations of graphs
✍ Stasys Jukna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~⊆{1, …, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

Representation and generation of graphs
Representation and generation of graphs using iterated function systems
✍ D.J. Nettleton 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 159 KB

lterated function systems have been applied as a means of shape representation and generation. This paper describes how they may be applied in a similar manner to graphs. Although the study is in its early stages, it is anticipated that this means of representation will offer a range of new techniqu

Representation of Permutation Groups by
Representation of Permutation Groups by Coloured Graphs
✍ Ulrike Baumann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

## Abstract The topic of this paper is representing permutation groups by connected graphs with proper edge colourings. Every connected graph __G__ with a proper edge colouring ϕ determines a group __A~c~__(__G__, ϕ) of graph automorphisms which preserve the colours of the edges. We characterize pe

Kolmogorov complexity and set theoretica
Kolmogorov complexity and set theoretical representations of integers
✍ Marie Ferbus-Zanda; Serge Grigorieff 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB

## Abstract We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivi