Question

Use structural induction to prove that $v(G) = e(G) + 1$

score 128 · Answer 1 · 2020-05-27 04:34:14

128

Views

Use structural induction to prove that $v(G) = e(G) + 1$

Published on 27 May 2020 - 4:34

score 149 · Answer 2 · 2026-03-25 11:02:41

149

Views

Automorphism group of rooted tree is a profinite group

Published on 25 Mar 2026 - 11:02

score 358 · Answer 3 · 2020-05-31 15:06:29

358

Views

Prove that if MST T1 has k edges with weight 1 then T2 has also k edges with weight 1

Published on 31 May 2020 - 15:06

score 120 · Answer 4 · 2020-06-01 09:24:11

120

Views

Max min spanning tree diameter

Published on 01 Jun 2020 - 9:24

score 164 · Answer 5 · 2020-06-03 00:20:56

164

Views

Kruskal's algorithm for the connector problem with pre-assignment

Published on 03 Jun 2020 - 0:20

score 105 · Answer 6 · 2020-06-04 04:54:12

105

Views

Discrete Mathematics - Trees

Published on 04 Jun 2020 - 4:54

score 2.2k · Answer 7 · 2020-06-04 19:49:25

2.2k

Views

Does removing the "heaviest" edge of all cycles in an (unweighted) graph result in a minimum spanning tree?

Published on 04 Jun 2020 - 19:49

score 67 · Answer 8 · 2026-03-25 11:04:35

67

Views

Usefulness of the inverse of $I-A$ in a finite tree network

Published on 25 Mar 2026 - 11:04

score 138 · Answer 9 · 2020-06-13 11:25:43

138

Views

prove that every complete graph with 4 or more vertices has two spanning trees with disjoint edges

Published on 13 Jun 2020 - 11:25

score 88 · Answer 10 · 2020-06-14 18:17:00

88

Views

Graph with treewidth $\Omega(k^2)$ that does not contain a $k \times k$ grid as minor

Published on 14 Jun 2020 - 18:17

score 400 · Answer 11 · 2026-03-25 18:56:31

400

Views

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

Published on 25 Mar 2026 - 18:56

score 47 · Answer 12 · 2020-06-20 16:55:16

47

Views

Undirected tree, what about G'?

Published on 20 Jun 2020 - 16:55

score 73 · Answer 13 · 2020-06-20 19:14:54

73

Views

How many spanning trees we can build using 26 different nodes that have at least 8 nodes whose degree is exactly 4?

Published on 20 Jun 2020 - 19:14

score 662 · Answer 14 · 2020-06-20 23:24:18

662

Views

Every non-star tree is (isomorphic to) a subgraph of its complement

Published on 20 Jun 2020 - 23:24

score 74 · Answer 15 · 2026-03-25 17:37:37

74

Views

Which graphs $G$ in which any circle is an edge separator maximize $||G||$ for fixed |G|?

Published on 25 Mar 2026 - 17:37

List Question

Use structural induction to prove that $v(G) = e(G) + 1$

Automorphism group of rooted tree is a profinite group

Prove that if MST T1 has k edges with weight 1 then T2 has also k edges with weight 1

Max min spanning tree diameter

Kruskal's algorithm for the connector problem with pre-assignment

Discrete Mathematics - Trees

Does removing the "heaviest" edge of all cycles in an (unweighted) graph result in a minimum spanning tree?

Usefulness of the inverse of $I-A$ in a finite tree network

prove that every complete graph with 4 or more vertices has two spanning trees with disjoint edges

Graph with treewidth $\Omega(k^2)$ that does not contain a $k \times k$ grid as minor

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

Undirected tree, what about G'?

How many spanning trees we can build using 26 different nodes that have at least 8 nodes whose degree is exactly 4?

Every non-star tree is (isomorphic to) a subgraph of its complement

Which graphs $G$ in which any circle is an edge separator maximize $||G||$ for fixed |G|?

Trending Questions

Popular # Hahtags

Popular Questions