Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities

DOI10.1006/EUJC.1998.0256zbMATH Open0917.05075OpenAlexW2006226241MaRDI QIDQ1279873FDOQ1279873

Authors: Attila Sali, Gábor Simonyi 

Publication date: 17 February 1999

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1998.0256

Recommendations

• Sperner capacity of small digraphs
• On the Shannon capacity of a graph
• On the Shannon capacity of a directed graph
• Local chromatic number and Sperner capacity

zbMATH Keywords

digraphsShannon capacitytournamentself-complementary graphSperner capacity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24) Graph theory (05C99)

Cited In (10)

• A note on an embedding problem in transitive tournaments
• A note on decompositions of transitive tournaments
• Algorithms for finding maximum transitive subtournaments
• On colorful edge triples in edge-colored complete graphs
• Partitioning transitive tournaments into isomorphic digraphs
• Sperner capacity of small digraphs
• Relations between the local chromatic number and its directed version
• Local chromatic number and Sperner capacity
• Transitive tournaments and self-complementary graphs
• On directed local chromatic number, shift graphs, and Borsuk-like graphs

This page was built for publication: Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279873)