Question

Find the number of trees on the vertex set V = {1, 2, ..., 8} in which all vertices have degree 1 or 4.

score 659 · Answer 1 · 2014-12-03 01:26:51

659

Views

Find the number of trees on the vertex set V = {1, 2, ..., 8} in which all vertices have degree 1 or 4.

Published on 03 Dec 2014 - 1:26

score 238 · Answer 2 · 2014-12-03 04:54:43

238

Views

The number of (non-equal) forests on the vertex set V = {1, 2, ...,n} that contains exactly 2 connected components is given by

Published on 03 Dec 2014 - 4:54

score 7.9k · Answer 3 · 2026-03-25 15:59:21

7.9k

Views

The decision tree has height at least $\log n!$

Published on 25 Mar 2026 - 15:59

score 1.3k · Answer 4 · 2026-03-25 16:01:43

1.3k

Views

A decision tree has an expected depth of at least $\log n!$

Published on 25 Mar 2026 - 16:01

score 238 · Answer 5 · 2014-12-05 22:23:57

238

Views

expression tree

Published on 05 Dec 2014 - 22:23

score 711 · Answer 6 · 2014-12-08 12:48:59

711

Views

How to check homeomorphic embedding relation programmatically?

Published on 08 Dec 2014 - 12:48

score 3.9k · Answer 7 · 2014-12-09 02:17:17

3.9k

Views

Graph theory, trees, show T is subgraph of G

Published on 09 Dec 2014 - 2:17

score 111 · Answer 8 · 2014-12-10 22:15:13

111

Views

Why doesn't Tutte polynomial T(1,1) equal 0?

Published on 10 Dec 2014 - 22:15

score 220 · Answer 9 · 2014-12-12 22:11:03

220

Views

How many trees can be drawn using$n$ vertices without rebuilding isomorphs?

Published on 12 Dec 2014 - 22:11

score 666 · Answer 10 · 2026-03-25 15:59:10

666

Views

Spectrum of infinite d-regular tree

Published on 25 Mar 2026 - 15:59

score 1.7k · Answer 11 · 2014-12-19 11:48:28

1.7k

Views

Tree Traversal-Is the order ascending?

Published on 19 Dec 2014 - 11:48

score 95 · Answer 12 · 2026-03-26 04:30:16

95

Views

Graph theory and tree company

Published on 26 Mar 2026 - 4:30

score 432 · Answer 13 · 2026-03-25 18:57:28

432

Views

Maps of primitive vectors and Conway's river, has anyone built this in SAGE?

Published on 25 Mar 2026 - 18:57

score 127 · Answer 14 · 2026-03-26 17:27:47

127

Views

Expected Max Pseudotree Size

Published on 26 Mar 2026 - 17:27

score 251 · Answer 15 · 2014-12-24 00:16:07

251

Views

Is this random binary tree finite?

Published on 24 Dec 2014 - 0:16

List Question

Find the number of trees on the vertex set V = {1, 2, ..., 8} in which all vertices have degree 1 or 4.

The number of (non-equal) forests on the vertex set V = {1, 2, ...,n} that contains exactly 2 connected components is given by

The decision tree has height at least $\log n!$

A decision tree has an expected depth of at least $\log n!$

expression tree

How to check homeomorphic embedding relation programmatically?

Graph theory, trees, show T is subgraph of G

Why doesn't Tutte polynomial T(1,1) equal 0?

How many trees can be drawn using$n$ vertices without rebuilding isomorphs?

Spectrum of infinite d-regular tree

Tree Traversal-Is the order ascending?

Graph theory and tree company

Maps of primitive vectors and Conway's river, has anyone built this in SAGE?

Expected Max Pseudotree Size

Is this random binary tree finite?

Trending Questions

Popular # Hahtags

Popular Questions