๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities

โœ Scribed by A. Sali; G. Simonyi

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
81 KB
Volume
20
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

โœฆ Synopsis

We prove that the edges of a self-complementary graph and its complement can be oriented in such a way that they remain isomorphic as digraphs and their union is a transitive tournament. This result is used to explore the relation between the Shannon and Sperner capacity of certain graphs. In particular, using results of Lovรกsz, we show that the maximum Sperner capacity over all orientations of the edges of a vertex-transitive self-complementary graph equals its Shannon capacity.

๐Ÿ“œ SIMILAR VOLUMES

Pseudo-random properties of self-complem
Pseudo-random properties of self-complementary symmetric graphs
โœ Andrzej Kisielewicz; Wojciech Peisert ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 74 KB

## Abstract There are some results in the literature showing that Paley graphs behave in many ways like random graphs __G__(__n__, 1/2). In this paper, we extend these results to the other family of selfโ€complementary symmetric graphs. ยฉ 2004 Wiley Periodicals, Inc. J Graph Theory 47: 310โ€“316, 2004

A class of self-complementary graphs and
A class of self-complementary graphs and lower bounds of some ramsey numbers
โœ C. R. J. Clapham ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 119 KB ๐Ÿ‘ 1 views

## Abstract A method is described of constructing a class of selfโ€complementary graphs, that includes a selfโ€complementary graph, containing no __K__~5~, with 41 vertices and a selfโ€complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num

Handbook of Personality and Self-Regulat
Handbook of Personality and Self-Regulation || Relations of Self-Regulatory/Control Capacities to Maladjustment, Social Competence, and Emotionality
โœ Hoyle, Rick H. ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Wiley-Blackwell ๐ŸŒ English โš– 558 KB

The term self-regulation refers to processes by which people control their thoughts, feelings, and behaviors. When people succeed at self-regulation, they effectively manage their perceptions of themselves and their social surroundings. They behave in ways that are consistent with their goals and st

The number of self-complementary achiral
The number of self-complementary achiral necklaces
โœ E. M. Palmer; A. J. Schwenk ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 304 KB

## Abstract Necklaces with beads of two colors which are left unchanged both by a reflection as well as by the interchange of the two colors are characterized in terms of their axes of symmetry. This characterization is then used to enumerate them. For __n__ = 2^__r__^m with __r__ โ‰ฅ 1 and __m__ odd

Excluding Induced Subdivisions of the Bu
Excluding Induced Subdivisions of the Bull and Related Graphs
โœ Maria Chudnovsky; Irena Penev; Alex Scott; Nicolas Trotignon ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 233 KB

## Abstract For any graph __H__, let Forb\*(__H__) be the class of graphs with no induced subdivision of __H__. It was conjectured in [J Graph Theory, 24 (1997), 297โ€“311] that, for every graph __H__, there is a function __f__~__H__~: โ„•โ†’โ„ such that for every graph __G__โˆˆForb\*(__H__), ฯ‡(__G__)โ‰ค__f__