scientific article; zbMATH DE number 1033851
From MaRDI portal
Publication:4344223
zbMath0974.05062MaRDI QIDQ4344223
Hanna D. Robalewska, Nicholas C. Wormald, Michael S. O. Molloy, Robert W. Robinson
Publication date: 26 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The Number of Satisfying Assignments of Random Regulark-SAT Formulas, 3-star factors in random \(d\)-regular graphs, Graph factors and factorization: 1985--2003: a survey, An FPTAS for the hardcore model on random regular bipartite graphs, Unnamed Item, Statistical limits of spiked tensor models, The number of Euler tours of random directed graphs, Discrepancy properties for random regular digraphs, Cycle Factors and Renewal Theory, Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models, The distribution of sandpile groups of random regular graphs, Hamiltonian decompositions of random bipartite regular graphs., Expansion of random graphs: new proofs, new results, Circular law for the sum of random permutation matrices, On the Number of Perfect Matchings in Random Lifts, Hamilton cycles containing randomly selected edges in random regular graphs, Hamilton cycles in the union of random permutations, Unnamed Item, Optimality and sub-optimality of PCA. I: Spiked random matrix models, THE ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF 3-STAR FACTORS IN RANDOM d-REGULAR GRAPHS, On the hardness of sampling independent sets beyond the tree threshold, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, Regular graphs with no homomorphisms onto cycles, Improved inapproximability results for counting independent sets in the hard-core model
