Complete matchings in random subgraphs of the cube

DOI10.1002/RSA.3240010107MaRDI QIDQ3490032zbMATH OpenOpenAlexFDO

Authors Béla Bollobás

Publication date 1990

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240010107

zbMATH Keywords

complete matchingdiscrete cubehitting timerandom cuberandom subgraphs

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 26595
• Perfect matchings in random subgraphs of regular bipartite graphs
• Matchings in random spanning subgraphs of cubelike graphs
• The Evolution of Random Subgraphs of the Cube
• Connectivity properties of random subgraphs of the cube

Cites work

• A Family of Combinatorial Identities
• The Evolution of the Cube

Cited in

(12)

• Maximum induced matchings of random cubic graphs
• Expansion in supercritical random subgraphs of the hypercube and its consequences
• Matchings in random spanning subgraphs of cubelike graphs
• Tree-Matchings in Graph Processes
• scientific article; zbMATH DE number 26595 (Why is no real title available?)
• The Evolution of Random Subgraphs of the Cube
• Connectivity properties of random subgraphs of the cube
• Uniform multicommodity flows in the hypercube with random edge‐capacities
• The component structure of dense random subgraphs of the hypercube
• Climbing up a random subgraph of the hypercube
• Minimum degree k and k-connectedness usually arrive together
• Hamiltonicity of random subgraphs of the hypercube

This page was built for publication: Complete matchings in random subgraphs of the cube

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