Voltar
Artigo Acesso aberto Revisado por pares
BIBTEX RIS

Approximate counting of regular hypergraphs

2013; Elsevier BV; Volume: 113; Issue: 19-21 Linguagem: Inglês

10.1016/j.ipl.2013.07.018

ISSN

1872-6119

Autores

Andrzej Dudek, Alan Frieze, Andrzej Ruciński, Matas Šileikis,

Tópico(s)

Advanced Graph Theory Research

Resumo

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.

Referência(s)