V. P. Polesskij

Available identifiers

zbMath Open polesskij.v-pMaRDI QIDQ803173

List of research outcomes

Publication	Date of Publication	Type
On bounds for the monotone-structure reliability	2003-11-03	Paper
Untying of clutter-family supports and its role in the monotone-structure reliability theory	2002-06-03	Paper
Lower bound on the reliability of a network with a 2-connected structure	2001-08-02	Paper
Clutter untypings, correlation inequalities, and bounds for combinatorial reliability.	1998-11-20	Paper
The best possible bounds for full rank probability of a random submatroid	1997-05-29	Paper
Bounds of two-terminal network reliability and base spectrum of network graph	1995-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q3364588	1995-01-01	Paper
Lower bounds on full rank probability in random matroids	1994-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q4303878	1994-09-25	Paper
Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum	1994-05-18	Paper
Lower bounds of connectedness probability for some classes of random graphs	1994-03-14	Paper
Bounds on probability of connectedness of a random graph	1990-01-01	Paper
Bounds on probability of group connectedness of a random graph	1990-01-01	Paper
Obstacles to partitioning a graph into trees	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3798670	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4735203	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4141828	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4147994	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4173396	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101857	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5181633	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4073405	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4086956	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5181632	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5682351	1971-01-01	Paper

Research outcomes over time

This page was built for person: V. P. Polesskij