Uniform generation of \(d\)-factors in dense host graphs
type: Item
instance of: scholarly article
title: Uniform generation of \(d\)-factors in dense host graphs
zbMATH Open document ID: 1294.05108
author: Pu Gao
published in: Graphs and Combinatorics
publication date: 2014-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 6304669
zbMATH Keywords: uniform generation
zbMATH Keywords: enumeration
zbMATH Keywords: \(d\)-factors
zbMATH Keywords: switching method
MaRDI profile type: Publication
full work available at URL: s00373-013-1284-1
OpenAlex ID: W2054810611
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: Exponentially many perfect matchings in cubic graphs
cites work: Approximating the Permanent
cites work: Q3096705
cites work: Q3684147
cites work: Uniform generation of random regular graphs of moderate degree
cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
cites work: Asymptotic enumeration by degree sequence of graphs of high degree
DOI: 10.1007/S00373-013-1284-1
description: scientific article; zbMATH DE number 6304669