Matchings and cycle covers in random digraphs

DOI10.1016/0166-218X(91)90082-8zbMath0758.05079MaRDI QIDQ1182313

John G. Gimbel, Edgar M. Palmer

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycle coverrandom digraphsperfet matching

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectivity of random m-orientable graphs and digraphs
• Maximum matchings in a class of random graphs
• Matchings in random regular bipartite digraphs
• On the existence of Hamiltonian cycles in a class of random graphs
• General percolation and random graphs
• On Representatives of Subsets