Question

If I have an MST, and I add any edge to create a cycle, will removing the heaviest edge from that cycle result in an MST?

score 1.9k · Answer 1 · 2020-02-08 18:09:37

1.9k

Views

If I have an MST, and I add any edge to create a cycle, will removing the heaviest edge from that cycle result in an MST?

Published on 08 Feb 2020 - 18:09

score 94 · Answer 2 · 2020-02-10 21:08:35

94

Views

Sum over binary tree of minimum size of children

Published on 10 Feb 2020 - 21:08

score 64 · Answer 3 · 2020-02-19 04:27:26

64

Views

Number of functions $f:[n]\to[n]$ with a core of size 1

Published on 19 Feb 2020 - 4:27

score 19 · Answer 4 · 2026-03-25 12:42:44

19

Views

Number systems, squares and probability

Published on 25 Mar 2026 - 12:42

score 248 · Answer 5 · 2020-03-03 12:39:01

248

Views

Prove that removing k − 1 edges from a tree T results in a graph which has k components, by induction

Published on 03 Mar 2020 - 12:39

score 388 · Answer 6 · 2020-03-08 12:22:43

388

Views

Graph has at least 2 cycles of equal length if e(G)=2v(G)-3

Published on 08 Mar 2020 - 12:22

score 396 · Answer 7 · 2020-03-08 15:14:56

396

Views

Number of trees with vertex set $[n]$ and vertex $i$ with $deg(v_i)=d_i$ s.t. $\sum d_i = 2n-2$

Published on 08 Mar 2020 - 15:14

score 1.7k · Answer 8 · 2020-03-08 23:25:17

1.7k

Views

How many non-isomorphic binary trees can you make with 3 vertices?

Published on 08 Mar 2020 - 23:25

score 132 · Answer 9 · 2020-03-09 08:17:08

132

Views

How many ways are there to count binary trees with "superleaves"

Published on 09 Mar 2020 - 8:17

score 620 · Answer 10 · 2020-03-11 02:14:07

620

Views

Prove that $\left\lfloor{\frac{n}{2}}\right\rfloor+\left\lfloor\frac{\left\lceil\frac{n}{2}\right\rceil}{2}\right\rfloor+\cdots=n-1$.

Published on 11 Mar 2020 - 2:14

score 1.1k · Answer 11 · 2020-03-13 05:31:13

1.1k

Views

count spanning trees (up to isomorphism) in K3,3

Published on 13 Mar 2020 - 5:31

score 28 · Answer 12 · 2020-03-13 18:28:16

28

Views

How to turn parenthesis notation for tree into actual tree drawing?

Published on 13 Mar 2020 - 18:28

score 60 · Answer 13 · 2020-03-21 16:26:02

60

Views

Count number of paths to a particular place on tree

Published on 21 Mar 2020 - 16:26

score 38 · Answer 14 · 2020-03-24 22:50:51

38

Views

For any odd positive integer $n$, there is a recursive binary tree that has depth at most $\log_2(n)$ - why?

Published on 24 Mar 2020 - 22:50

score 67 · Answer 15 · 2020-03-31 04:43:49

67

Views

Help on computing some property value of a binary tree.

Published on 31 Mar 2020 - 4:43

List Question

If I have an MST, and I add any edge to create a cycle, will removing the heaviest edge from that cycle result in an MST?

Sum over binary tree of minimum size of children

Number of functions $f:[n]\to[n]$ with a core of size 1

Number systems, squares and probability

Prove that removing k − 1 edges from a tree T results in a graph which has k components, by induction

Graph has at least 2 cycles of equal length if e(G)=2v(G)-3

Number of trees with vertex set $[n]$ and vertex $i$ with $deg(v_i)=d_i$ s.t. $\sum d_i = 2n-2$

How many non-isomorphic binary trees can you make with 3 vertices?

How many ways are there to count binary trees with "superleaves"

Prove that $\left\lfloor{\frac{n}{2}}\right\rfloor+\left\lfloor\frac{\left\lceil\frac{n}{2}\right\rceil}{2}\right\rfloor+\cdots=n-1$.

count spanning trees (up to isomorphism) in K3,3

How to turn parenthesis notation for tree into actual tree drawing?

Count number of paths to a particular place on tree

For any odd positive integer $n$, there is a recursive binary tree that has depth at most $\log_2(n)$ - why?

Help on computing some property value of a binary tree.

Trending Questions

Popular # Hahtags

Popular Questions