Tools
Chlebík, Miroslav and Chlebíková, Janka (2013) On the conjunctive capacity of graphs. In: Du, Ding-Zhu and Zhang, Guochuan (eds.) Computing and combinatorics: 19th annual international conference, COCOON 2013, Hangzhou, China, June 21-23, 2013 : proceedings. Lecture notes in computer science (7936). Springer-Verlag, Berlin, pp. 280-291. ISBN 9783642387678
![]() |
PDF
- Published Version
Restricted to SRO admin only Download (523kB) |
Abstract
The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal combinatorics.
Item Type: | Book Section |
---|---|
Schools and Departments: | School of Mathematical and Physical Sciences > Mathematics |
Subjects: | Q Science > QA Mathematics > QA0075 Electronic computers. Computer science |
Depositing User: | Miroslav Chlebik |
Date Deposited: | 16 May 2014 06:27 |
Last Modified: | 16 May 2014 06:27 |
URI: | http://srodev.sussex.ac.uk/id/eprint/48709 |
View download statistics for this item
📧 Request an update