Question

How many trees, not necessarily spanning, are there with exactly m edges and n vertices?

score 80 · Answer 1 · 2026-04-13 18:48:24

80

Views

How many trees, not necessarily spanning, are there with exactly m edges and n vertices?

Published on 13 Apr 2026 - 18:48

score 2.1k · Answer 2 · 2026-04-10 06:01:39

2.1k

Views

What is a dyad?

Published on 10 Apr 2026 - 6:01

score 136 · Answer 3 · 2026-04-11 18:49:30

136

Views

proof for critical graphs

Published on 11 Apr 2026 - 18:49

score 919 · Answer 4 · 2026-04-15 22:33:55

919

Views

Prove that every subgraph of forest has at least one vertex of degree < 2

Published on 15 Apr 2026 - 22:33

score 386 · Answer 5 · 2026-04-15 02:51:04

386

Views

Proving an 'obvious' Ramsey upperbound

Published on 15 Apr 2026 - 2:51

score 58 · Answer 6 · 2026-04-08 23:15:25

58

Views

How to calculate least moves of fruit.

Published on 08 Apr 2026 - 23:15

score 109 · Answer 7 · 2026-04-16 11:28:29

109

Views

Having the number 59 for example find $x$ which $x^2$ is closer but lower to the 59. In this case is 7

Published on 16 Apr 2026 - 11:28

score 418 · Answer 8 · 2026-04-15 03:01:30

418

Views

How many vertices should we discard so that the remaining partial graph is Eulerian

Published on 15 Apr 2026 - 3:01

score 53 · Answer 9 · 2026-04-16 13:24:29

53

Views

Is there notation or a name for the complement of the unbounded face of a planar graph?

Published on 16 Apr 2026 - 13:24

score 103 · Answer 10 · 2026-04-10 11:17:31

103

Views

how to prove the solution to brainteaser "Urban planning"

Published on 10 Apr 2026 - 11:17

score 117 · Answer 11 · 2026-04-16 08:05:05

117

Views

maximizing the inverse degree in a graph

Published on 16 Apr 2026 - 8:05

score 73 · Answer 12 · 2026-04-16 01:46:59

73

Views

Making a graph Hamiltonian by stacking it up

Published on 16 Apr 2026 - 1:46

score 76 · Answer 13 · 2026-04-15 16:07:02

76

Views

Number of tries to guess M-1 letters from M-letters-code.

Published on 15 Apr 2026 - 16:07

score 49 · Answer 14 · 2026-04-16 01:30:03

49

Views

Circle within sub-graph of $K_n$

Published on 16 Apr 2026 - 1:30

score 913 · Answer 15 · 2026-04-10 16:38:05

913

Views

Mathematical Predicate logic

Published on 10 Apr 2026 - 16:38

List Question

How many trees, not necessarily spanning, are there with exactly m edges and n vertices?

What is a dyad?

proof for critical graphs

Prove that every subgraph of forest has at least one vertex of degree < 2

Proving an 'obvious' Ramsey upperbound

How to calculate least moves of fruit.

Having the number 59 for example find $x$ which $x^2$ is closer but lower to the 59. In this case is 7

How many vertices should we discard so that the remaining partial graph is Eulerian

Is there notation or a name for the complement of the unbounded face of a planar graph?

how to prove the solution to brainteaser "Urban planning"

maximizing the inverse degree in a graph

Making a graph Hamiltonian by stacking it up

Number of tries to guess M-1 letters from M-letters-code.

Circle within sub-graph of $K_n$

Mathematical Predicate logic

Trending Questions

Popular # Hahtags

Popular Questions