PUMaC 2025 · 组合（A 组） · 第 7 题

PUMaC 2025 — Combinatorics (Division A) — Problem 7

Consider the graph shown below with 4050 vertices and 6073 edges. Each edge is independently 1 deleted with probability . If C is the expected value of the number of connected components 2 of the resulting graph, compute the nearest integer to 49 C . · · · · · · 2

解析

暂无解答链接。

No solutions link available.