scientific article; zbMATH DE number 3777557

MaRDI QIDQ3956993zbMATH OpenFDO

Authors Andrzej Ruciński

Publication date 1982

zbMATH Keywords

almost sure propertycomplete graphdisjoint matchingsk-factorrandom graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Combinatorial probability (60C05)

Recommendations

• The number of matchings in random graphs
• On matchings in stochastic Kronecker graphs
• Random matchings in regular graphs
• The number of matchings in random regular graphs and bipartite graphs
• Maximum matchings in a class of random graphs
• On the number of k-matchings in graphs
• Random matching problems on the complete graph
• Matchings in random biregular bipartite graphs
• Factors in random graphs

Cited in

(8)

• Matching and covering the vertices of a random graph by copies of a given graph
• Kernels in random graphs
• scientific article; zbMATH DE number 3891417 (Why is no real title available?)
• Factors in random graphs
• \({K_4}\)-factors in random graphs
• On fractional K‐factors of random graphs
• On the existence of \(\left[ {k,k + 1} \right]\)-factors in random graphs
• On matchings in stochastic Kronecker graphs

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