One-factor in random graphs based on vertex choice

DOI10.1016/0012-365X(82)90023-1zbMath0495.05058MaRDI QIDQ1169488

S. Singh

Publication date: 1982

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

zbMATH Keywords

complete matchingRandom graph

Mathematics Subject Classification ID

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

Related Items

Maximum matchings in a class of random graphs, Graph factors and factorization: 1985--2003: a survey, On factors in random graphs, On randomk-out subgraphs of large graphs, A threshold for perfect matchings in random d-pure hypergraphs, How many random edges make a graph Hamiltonian?, Random near-regular graphs and the node packing problem

Cites Work

• Unnamed Item
• Matchings in random regular bipartite digraphs
• On factors in random graphs
• Hamiltonian circuits in random graphs
• On the Expected Value of a Random Assignment Problem
• On the strength of connectedness of a random graph
• On the existence of a factor of degree one of a connected random graph
• The Factorization of Linear Graphs