Question

vertex u and v connected via an edge implies $C(u)=C(v)$

score 114 · Answer 1 · 2018-04-24 03:04:40

114

Views

vertex u and v connected via an edge implies $C(u)=C(v)$

Published on 24 Apr 2018 - 3:04

score 384 · Answer 2 · 2018-04-24 05:09:42

384

Views

Graph_Theory: Clubs and residents

Published on 24 Apr 2018 - 5:09

score 360 · Answer 3 · 2018-04-24 10:08:49

360

Views

Show that $|V(G)| \leq \chi (G) \alpha (G) $

Published on 24 Apr 2018 - 10:08

score 99 · Answer 4 · 2018-04-24 10:39:16

99

Views

Equal weighted colors in fractional colorings

Published on 24 Apr 2018 - 10:39

score 144 · Answer 5 · 2018-04-24 12:38:14

144

Views

How to prove G is a perfect matching

Published on 24 Apr 2018 - 12:38

score 345 · Answer 6 · 2018-04-24 14:46:08

345

Views

Properties of the class of $(K_{1,3} ,K_{4})$-free graphs

Published on 24 Apr 2018 - 14:46

score 280 · Answer 7 · 2026-03-25 06:21:19

280

Views

Prove the probability of the graph containing a triangle is 0 as n→∞

Published on 25 Mar 2026 - 6:21

score 58 · Answer 8 · 2026-03-25 06:04:47

58

Views

The nonexistence of 8-transitive graphs

Published on 25 Mar 2026 - 6:04

score 41 · Answer 9 · 2026-03-25 01:15:19

41

Views

Graph partitioning for two graphs at once

Published on 25 Mar 2026 - 1:15

score 42 · Answer 10 · 2026-03-25 02:59:48

42

Views

Minimum euclidean spanning tree in n dimensional space

Published on 25 Mar 2026 - 2:59

score 457 · Answer 11 · 2026-03-25 09:27:29

457

Views

Why are the Automorphisms $\text{Aut}(T_2)$ of the regular, infinite, binary rooted tree the length-preserving permutations?

Published on 25 Mar 2026 - 9:27

score 67 · Answer 12 · 2026-03-25 04:36:55

67

Views

Regular properties of a graph

Published on 25 Mar 2026 - 4:36

score 1.4k · Answer 13 · 2026-03-25 18:49:41

1.4k

Views

If a tree has $n$ vertices, then it must have a path with at least $k$ vertices or at least $n/k$ leaves

Published on 25 Mar 2026 - 18:49

score 137 · Answer 14 · 2018-04-25 18:46:40

137

Views

symmetric $(2k)\times (2k)$ matrix, $k \geq 4$, consisting of $0$s and $1$s with exactly $k$ ones in each row and column

Published on 25 Apr 2018 - 18:46

score 76 · Answer 15 · 2018-04-25 20:13:26

76

Views

Graph Theory: Connectivity

Published on 25 Apr 2018 - 20:13

List Question

vertex u and v connected via an edge implies $C(u)=C(v)$

Graph_Theory: Clubs and residents

Show that $|V(G)| \leq \chi (G) \alpha (G) $

Equal weighted colors in fractional colorings

How to prove G is a perfect matching

Properties of the class of $(K_{1,3} ,K_{4})$-free graphs

Prove the probability of the graph containing a triangle is 0 as n→∞

The nonexistence of 8-transitive graphs

Graph partitioning for two graphs at once

Minimum euclidean spanning tree in n dimensional space

Why are the Automorphisms $\text{Aut}(T_2)$ of the regular, infinite, binary rooted tree the length-preserving permutations?

Regular properties of a graph

If a tree has $n$ vertices, then it must have a path with at least $k$ vertices or at least $n/k$ leaves

symmetric $(2k)\times (2k)$ matrix, $k \geq 4$, consisting of $0$s and $1$s with exactly $k$ ones in each row and column

Graph Theory: Connectivity

Trending Questions

Popular # Hahtags

Popular Questions