Uniform generation of d-factors in dense host graphs

DOI10.1007/S00373-013-1284-1zbMATH Open1294.05108OpenAlexW2054810611MaRDI QIDQ2014710FDOQ2014710

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

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

zbMATH Keywords

enumerationswitching methoduniform generation\(d\)-factors

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)