Uniform generation of d-factors in dense host graphs

DOI10.1007/S00373-013-1284-1MaRDI QIDQ2014710zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Uniform generation of spanning regular subgraphs of a dense graph
• Fast uniform generation of regular graphs
• \(H\)-factors in dense graphs
• Uniform generation of random regular graphs
• Distribution of the number of spanning regular subgraphs in random graphs

Cites work

• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Approximating the Permanent
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Exponentially many perfect matchings in cubic graphs
• Subgraphs of random graphs with specified degrees
• The asymptotic number of labeled graphs with given degree sequences
• Uniform generation of random regular graphs of moderate degree

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014710)