Combinatorial Algebra and Random Graphs

DOI10.1137/1114052MaRDI QIDQ5650709zbMATH OpenOpenAlexFDO

Authors V. E. Stepanov

Publication date 1969

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1114052

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cited in

(7)

• The expected linearity of a simple equivalence algorithm
• Survey sampling in graphs
• Tree and forest weights and their application to nonuniform random graphs
• A generalization of an inequality of Stepanov
• Network reliability: Heading out on the highway
• Uncovering a graph
• Note on an extremal problem arising for unreliable networks in parallel computing

This page was built for publication: Combinatorial Algebra and Random Graphs

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