Sperner capacity of small digraphs

DOI10.3934/AMC.2009.3.125MaRDI QIDQ2268245zbMATH OpenOpenAlexFDO

Authors Lasse Kiviluoto, Vesa Vaskelainen, Patric R. J. Östergård

Publication date 10 March 2010

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2009.3.125

zbMATH Keywords

chromatic numberdigraphSperner capacity

Mathematics Subject Classification ID

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

Recommendations

• Different capacities of a digraph
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
• On the Shannon capacity of a directed graph
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• On clique growth in products of directed graphs

Cited in

(5)

• Algorithms for finding maximum transitive subtournaments
• Dynamic coloring of graphs having no \(K_5\) minor
• Colour number, capacity, and perfectness of directed graphs
• Local chromatic number and Sperner capacity
• On the Shannon capacity of a directed graph

This page was built for publication: Sperner capacity of small digraphs

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