On factors in random graphs

DOI10.1007/BF02761675MaRDI QIDQ1159696zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1981

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02761675

zbMATH Keywords

augmenting pathsfactorsrandom graphs

Mathematics Subject Classification ID

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

Cites work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• On the existence of a factor of degree one of a connected random graph
• On the strength of connectedness of a random graph
• One-factor in random graphs based on vertex choice
• The Subgraph Problem

Cited in

(10)

• How many random edges make a graph Hamiltonian?
• One-factor in random graphs based on vertex choice
• The circular law for random regular digraphs
• On 1-sum flows in undirected graphs
• Distribution of the number of spanning regular subgraphs in random graphs
• Packing tree factors in random and pseudo-random graphs
• Sparse random graphs: eigenvalues and eigenvectors
• Improved queue-size scaling for input-queued switches via graph factorization
• On the singularity of adjacency matrices for random regular digraphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: On factors in random graphs

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