scientific article; zbMATH DE number 1033851

MaRDI QIDQ4344223zbMATH OpenFDO

Authors Hanna D. Robalewska, Michael Molloy, R. W. Robinson, Nicholas Wormald

Publication date 26 November 2001

zbMATH Keywords

factorizationsperfect matchingsrandom regular graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 944215
• 1‐Factorizations of pseudorandom graphs
• scientific article; zbMATH DE number 3891417
• The number of matchings in random regular graphs and bipartite graphs

Cited in

(30)

• On the hardness of sampling independent sets beyond the tree threshold
• The isoperimetric number of random regular graphs
• Hamiltonian decompositions of random bipartite regular graphs.
• Circular law for the sum of random permutation matrices
• Optimality and sub-optimality of PCA. I: Spiked random matrix models
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Regular graphs with no homomorphisms onto cycles
• An FPTAS for the hardcore model on random regular bipartite graphs
• Statistical limits of spiked tensor models
• A Bayesian approach to tackling hard computational problems. (Preliminary report)
• Hamilton cycles containing randomly selected edges in random regular graphs
• Discrepancy properties for random regular digraphs
• Cycle factors and renewal theory
• The asymptotic distribution of the number of 3-star factors in random d-regular graphs
• Permutation Pseudographs and Contiguity
• The number of satisfying assignments of random regular k-SAT formulas
• The number of Euler tours of random directed graphs
• scientific article; zbMATH DE number 944215 (Why is no real title available?)
• Hamilton cycles in the union of random permutations
• On the number of perfect matchings in random lifts
• Expansion of random graphs: new proofs, new results
• Satisfiability thresholds for regular occupation problems
• The distribution of sandpile groups of random regular graphs
• 1‐Factorizations of pseudorandom graphs
• Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
• The degree-restricted random process is far from uniform
• Satisfiability thresholds for regular occupation problems
• Complexity of high-dimensional identity testing with coordinate conditional sampling
• 3-star factors in random d-regular graphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication:

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