Counting subgraphs in quasi-random 4-uniform hypergraphs

Rödl, V. & Skokan, J.ORCID logo (2005). Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Structures & Algorithms, 26(1-2), 160-203. https://doi.org/10.1002/rsa.20056
Copy
Item Type Article
Copyright holders © 2005 John Wiley and Sons
Departments LSE > Academic Departments > Mathematics
DOI 10.1002/rsa.20056
Date Deposited 18 Jun 2008
URI https://researchonline.lse.ac.uk/id/eprint/5768

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics