Question

connected Graph with $n$ vertices and $n-1$ edges contains unique $u-v$ path

score 296 · Answer 1 · 2022-05-09 15:14:27

296

Views

connected Graph with $n$ vertices and $n-1$ edges contains unique $u-v$ path

Published on 09 May 2022 - 15:14

score 90 · Answer 2 · 2022-05-09 18:58:02

90

Views

nullspace of matrix "related" to incidence matrix of a tree

Published on 09 May 2022 - 18:58

score 104 · Answer 3 · 2026-03-30 10:19:49

104

Views

What is a convex combination of graphs?

Published on 30 Mar 2026 - 10:19

score 76 · Answer 4 · 2026-03-27 01:47:50

76

Views

How can I show that for each $e = uv \in F_0$ we have $H[F^* \cup e]$ contains a cycle

Published on 27 Mar 2026 - 1:47

score 23 · Answer 5 · 2022-05-16 18:52:25

23

Views

Let $X,Y,Z,W$ be words with vector frequency $(x,y,z,w)$ , Find an optimal code.

Published on 16 May 2022 - 18:52

score 136 · Answer 6 · 2026-03-27 16:46:20

136

Views

I think I have discovered a new sorting algorithm using binary search tree.

Published on 27 Mar 2026 - 16:46

score 23 · Answer 7 · 2022-05-17 17:24:46

23

Views

Combinatorics, 2-Tree, Sequence

Published on 17 May 2022 - 17:24

score 32 · Answer 8 · 2022-05-18 19:04:49

How can I that if $\operatorname{part}(G'[A])=\operatorname{part}(G'[B])$, then $\operatorname{part}(G[A])=\operatorname{part}(G[B])$

score 104 · Answer 9 · 2022-05-19 21:32:39

104

Views

Spanning trees of specific graph

Published on 19 May 2022 - 21:32

score 56 · Answer 10 · 2022-05-19 22:10:57

Let $\{w_i\}_{i=1}^n$ be an optimal code such that $\{p_i\}_{i=1}^n$ are words' probability.prove $p_i=p_j \implies |w_i|-|w_j|\leq1$.

score 52 · Answer 11 · 2022-05-23 10:50:31

52

Views

Adding $k$ edges in a forest creates how many cycles?

Published on 23 May 2022 - 10:50

score 119 · Answer 12 · 2022-05-24 02:32:45

119

Views

How many ways can we extend a partial order of a rooted tree to a total order?

Published on 24 May 2022 - 2:32

score 105 · Answer 13 · 2022-05-24 20:45:18

105

Views

An Exercise in Graph and Set Theory

Published on 24 May 2022 - 20:45

score 41 · Answer 14 · 2026-03-28 06:41:01

41

Views

Number of k-MSTs in a graph

Published on 28 Mar 2026 - 6:41

score 93 · Answer 15 · 2026-03-31 15:22:13

93

Views

Independent sets with few neighbours

Published on 31 Mar 2026 - 15:22

List Question

connected Graph with $n$ vertices and $n-1$ edges contains unique $u-v$ path

nullspace of matrix "related" to incidence matrix of a tree

What is a convex combination of graphs?

How can I show that for each $e = uv \in F_0$ we have $H[F^* \cup e]$ contains a cycle

Let $X,Y,Z,W$ be words with vector frequency $(x,y,z,w)$ , Find an optimal code.

I think I have discovered a new sorting algorithm using binary search tree.

Combinatorics, 2-Tree, Sequence

How can I that if $\operatorname{part}(G'[A])=\operatorname{part}(G'[B])$, then $\operatorname{part}(G[A])=\operatorname{part}(G[B])$

Spanning trees of specific graph

Let $\{w_i\}_{i=1}^n$ be an optimal code such that $\{p_i\}_{i=1}^n$ are words' probability.prove $p_i=p_j \implies |w_i|-|w_j|\leq1$.

Adding $k$ edges in a forest creates how many cycles?

How many ways can we extend a partial order of a rooted tree to a total order?

An Exercise in Graph and Set Theory

Number of k-MSTs in a graph

Independent sets with few neighbours

Trending Questions

Popular # Hahtags

Popular Questions