uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Approximate counting of regular hypergraphs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.
2013 (English)In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 113, no 19-21, 785-788 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n(1/2)) In doing so, we extend to hypergraphs a switching technique of McKay and Wormald. 

Place, publisher, year, edition, pages
2013. Vol. 113, no 19-21, 785-788 p.
Keyword [en]
Combinatorial problems, Hypergraphs, Switching
National Category
URN: urn:nbn:se:uu:diva-210248DOI: 10.1016/j.ipl.2013.07.018ISI: 000325308700018OAI: oai:DiVA.org:uu-210248DiVA: diva2:661937
Available from: 2013-11-05 Created: 2013-11-04 Last updated: 2013-11-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Sileikis, Matas
By organisation
Department of Mathematics
In the same journal
Information Processing Letters

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 152 hits
ReferencesLink to record
Permanent link

Direct link