Rödl, Vojtech and Skokan, Jozef (2005) Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Structures and Algorithms, 26 (1-2). pp. 160-203. ISSN 1098-2418
Full text not available from this repository.| Item Type: | Article |
|---|---|
| Official URL: | http://www3.interscience.wiley.com/journal/38107/h... |
| Additional Information: | © 2005 John Wiley and Sons |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Departments > Mathematics Research centres and groups > Computational, Discrete and Applicable Mathematics@LSE (CDAM) |
| Date Deposited: | 18 Jun 2008 13:38 |
| URL: | http://eprints.lse.ac.uk/5768/ |
Actions (login required)
![]() |
Record administration - authorised staff only |
