Matchings in random regular bipartite digraphs
From MaRDI portal
Publication:1141656
DOI10.1016/0012-365X(80)90172-7zbMath0438.05031OpenAlexW2019496833MaRDI QIDQ1141656
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
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Maximum matchings in a class of random graphs, Order statistics and the linear assignment problem, Maximal paths in random dynamic graphs, Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph, Perfect fractional matchings in \(k\)-out hypergraphs, How many ways can a permutation be factored into two n-cycles?, The random linear bottleneck assignment problem, Unnamed Item, Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, On randomk-out subgraphs of large graphs, One-factor in random graphs based on vertex choice, Unnamed Item, Matchings and cycle covers in random digraphs, Random assignment problems, Asymptotics in the random assignment problem, Selected topics on assignment problems, Efficient web searching using temporal factors, Karp–Sipser on Random Graphs with a Fixed Degree Sequence, On the Spread of Random Graphs, On the existence of Hamiltonian cycles in a class of random graphs
Cites Work
