Carnegie Mellon University
Browse

Approximate counting of regular hypergraphs

Download (343.5 kB)
journal contribution
posted on 2013-06-26, 00:00 authored by Andrzej Dudek, Alan FriezeAlan Frieze, Andrzej Rucinski, Matas Sileikis

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

History

Publisher Statement

This is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at http://dx.doi.org/10.1016/j.ipl.2013.07.018

Date

2013-06-26

Usage metrics

    Categories

    Keywords

    Combinatorial problemsHypergraphsSwitchingMathematical Sciences not elsewhere classified

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC