scientific article; zbMATH DE number 3523603

zbMATH0335.05124MaRDI QIDQ4101857FDOQ4101857

Authors V. P. Polesskij, Michael V. Lomonosov

Publication date 1972

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05)

Cited in

(7)

• Reliable assignments of processors to tasks and factoring on matroids
• Note on an extremal problem arising for unreliable networks in parallel computing
• On graphs with randomly deleted edges
• Sparse reliable graph backbones
• Counting almost minimum cutsets with reliability applications
• Edge-packings of graphs and network reliability
• A certain polynomial of a graph and graphs with an extremal number of trees

This page was built for publication:

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