Question

Every Automorphism of a Tree Fixes an Edge or a Vertex Algebraic Proof

score 146 · Answer 1 · 2026-03-28 12:32:13

146

Views

Every Automorphism of a Tree Fixes an Edge or a Vertex Algebraic Proof

Published on 28 Mar 2026 - 12:32

score 378 · Answer 2 · 2022-10-18 13:36:27

378

Views

Maximum common edge subgraph of two trees in polynomial time?

Published on 18 Oct 2022 - 13:36

score 232 · Answer 3 · 2026-03-25 09:48:14

232

Views

How to find percolation threshold for trees?

Published on 25 Mar 2026 - 9:48

score 63 · Answer 4 · 2026-04-01 16:50:57

63

Views

Number of terms of the polynomial $\prod_{1\leq i<j\leq n}( x_{i}+x_{j})$

Published on 01 Apr 2026 - 16:50

score 111 · Answer 5 · 2022-10-26 12:04:34

111

Views

Spanning Tree that Preserves the Number of Branch Vertices

Published on 26 Oct 2022 - 12:04

score 265 · Answer 6 · 2022-10-28 10:17:38

265

Views

Maximum independent sets in a tree

Published on 28 Oct 2022 - 10:17

score 151 · Answer 7 · 2026-04-01 02:46:44

151

Views

Combinatorics proof of Abel's binomial theorem

Published on 01 Apr 2026 - 2:46

score 49 · Answer 8 · 2022-11-04 18:14:46

49

Views

Tree Labelling Conjecture

Published on 04 Nov 2022 - 18:14

score 38 · Answer 9 · 2022-11-07 21:56:01

38

Views

Is this binary tree (constructed from inorder and preorder traversal) possible?

Published on 07 Nov 2022 - 21:56

score 59 · Answer 10 · 2022-11-10 10:44:50

59

Views

Order of propositions in a logic tree

Published on 10 Nov 2022 - 10:44

score 25 · Answer 11 · 2022-11-10 22:27:24

25

Views

Proving all vertices of a binary tree satisfy a certain property

Published on 10 Nov 2022 - 22:27

score 125 · Answer 12 · 2022-11-15 12:13:06

125

Views

Proving that for any vertex in a spanning tree the number of appearances of this vertex in Prüfer code is degree of this vertex minus one

Published on 15 Nov 2022 - 12:13

score 62 · Answer 13 · 2022-11-15 16:05:37

62

Views

Proof that every finite tree with at least 2 vertices have at least two vertices of degree 1

Published on 15 Nov 2022 - 16:05

score 349 · Answer 14 · 2026-03-31 18:39:04

349

Views

Let $G = (V, E)$ be a forest, prove that there always exists a function $f:V\to \{0, 1\}$ such that $(u, v)\in E$ so $f(u)\neq f(v)$

Published on 31 Mar 2026 - 18:39

score 117 · Answer 15 · 2026-03-27 05:38:55

117

Views

Graph connected, exists a path containing at least one vertex of each of the four colors.

Published on 27 Mar 2026 - 5:38

List Question

Every Automorphism of a Tree Fixes an Edge or a Vertex Algebraic Proof

Maximum common edge subgraph of two trees in polynomial time?

How to find percolation threshold for trees?

Number of terms of the polynomial $\prod_{1\leq i<j\leq n}( x_{i}+x_{j})$

Spanning Tree that Preserves the Number of Branch Vertices

Maximum independent sets in a tree

Combinatorics proof of Abel's binomial theorem

Tree Labelling Conjecture

Is this binary tree (constructed from inorder and preorder traversal) possible?

Order of propositions in a logic tree

Proving all vertices of a binary tree satisfy a certain property

Proving that for any vertex in a spanning tree the number of appearances of this vertex in Prüfer code is degree of this vertex minus one

Proof that every finite tree with at least 2 vertices have at least two vertices of degree 1

Let $G = (V, E)$ be a forest, prove that there always exists a function $f:V\to \{0, 1\}$ such that $(u, v)\in E$ so $f(u)\neq f(v)$

Graph connected, exists a path containing at least one vertex of each of the four colors.

Trending Questions

Popular # Hahtags

Popular Questions