Estimation of the number of connected sets in a graph and the structure of components of random subsets

MaRDI QIDQ1594350zbMATH OpenFDO

Authors Alexander Sapozhenko

Publication date 28 January 2001

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsenumeration problemsinequalitiesrandom subsets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4160792
• On the number of connected sets with the neighborhood of a given size in a graph
• Extremal problems for connected set enumeration
• Bounds on probability of group connectedness of a random graph
• scientific article; zbMATH DE number 6813595

Cited in

(5)

• Connected components in random graphs with given expected degree sequences
• On computing boundary functional sums
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On the number of connected sets with the neighborhood of a given size in a graph
• Counting sparse induced subgraphs in locally dense graphs

This page was built for publication: Estimation of the number of connected sets in a graph and the structure of components of random subsets

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