Matchings in random regular bipartite digraphs

DOI10.1016/0012-365X(80)90172-7MaRDI QIDQ1141656zbMATH OpenOpenAlexFDO

Authors David W. Walkup

Publication date 1980

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(80)90172-7

zbMATH Keywords

matchingrandom graphregular bipartite digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Asymptotics and random matrices with row-sum and column sum-restrictions
• scientific article; zbMATH DE number 3216216 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• On the Expected Value of a Random Assignment Problem
• Pólya sequences, binomial convolution and the union of random sets
• Transversal theory. An account of some aspects of combinatorial mathematics

Cited in

(25)

• Maximum matchings in a class of random graphs
• Order statistics and the linear assignment problem
• Maximal paths in random dynamic graphs
• How many ways can a permutation be factored into two n-cycles?
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• One-factor in random graphs based on vertex choice
• Matchings and cycle covers in random digraphs
• Asymptotics in the random assignment problem
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• On the existence of Hamiltonian cycles in a class of random graphs
• Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph
• Perfect fractional matchings in \(k\)-out hypergraphs
• On random k-out subgraphs of large graphs
• Karp-Sipser on random graphs with a fixed degree sequence
• Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
• scientific article; zbMATH DE number 1496581 (Why is no real title available?)
• The random linear bottleneck assignment problem
• On the spread of random graphs
• scientific article; zbMATH DE number 7651215 (Why is no real title available?)
• Efficient web searching using temporal factors
• Interview with Alan Frieze
• Selected topics on assignment problems
• Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
• Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds
• Random assignment problems

This page was built for publication: Matchings in random regular bipartite digraphs

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