Uniform generation of \(d\)-factors in dense host graphs

DOI10.1007/s00373-013-1284-1zbMath1294.05108OpenAlexW2054810611MaRDI QIDQ2014710

Pu Gao

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1284-1

zbMATH Keywords

enumerationswitching methoduniform generation\(d\)-factors

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Related Items (2)

Edge-colorings avoiding fixed rainbow stars ⋮ Uniform generation of spanning regular subgraphs of a dense graph

Cites Work

• Unnamed Item
• Unnamed Item
• Exponentially many perfect matchings in cubic graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of labeled graphs with given degree sequences
• Asymptotic enumeration by degree sequence of graphs of high degree
• Approximating the Permanent
• Uniform generation of random regular graphs of moderate degree

This page was built for publication: Uniform generation of \(d\)-factors in dense host graphs