Question

What are some theorems giving lower bounds on the size of a maximum indepedent set of verticies of a planar graph?

score 120 · Answer 1 · 2026-04-14 00:39:40

120

Views

What are some theorems giving lower bounds on the size of a maximum indepedent set of verticies of a planar graph?

Published on 14 Apr 2026 - 0:39

score 33 · Answer 2 · 2026-04-17 00:23:21

33

Views

Number of non-isomorphic k-partite graphs.

Published on 17 Apr 2026 - 0:23

score 41 · Answer 3 · 2026-04-15 03:23:59

41

Views

Is there an efficient way you can draw graceful tree for $n$ points and $n-1$ edges by hand?

Published on 15 Apr 2026 - 3:23

score 218 · Answer 4 · 2026-04-16 19:05:06

218

Views

Random graph by deleting edges from graph

Published on 16 Apr 2026 - 19:05

score 1.8k · Answer 5 · 2026-04-16 15:38:38

1.8k

Views

Show that undirected connected 3-regular graph with 8 vertices has Hamiltonian path

Published on 16 Apr 2026 - 15:38

score 209 · Answer 6 · 2026-04-14 04:04:24

209

Views

What does it mean to draw a graph on a surface?

Published on 14 Apr 2026 - 4:04

score 275 · Answer 7 · 2026-04-14 08:52:04

275

Views

Proof of a weaker version of Hall's Marriage Theorem

Published on 14 Apr 2026 - 8:52

score 114 · Answer 8 · 2026-04-16 04:17:32

114

Views

Number of ways constructing a $k$-clique.

Published on 16 Apr 2026 - 4:17

score 1.5k · Answer 9 · 2026-04-15 14:37:50

1.5k

Views

Every block is eulerian graph is eulerian

Published on 15 Apr 2026 - 14:37

score 98 · Answer 10 · 2026-04-14 06:11:46

Number of possible ways n people can meet for lunch on a circular table such that each day no two people sit together who have sat together before?

score 111 · Answer 11 · 2026-04-16 07:13:18

111

Views

Number of steps in special graph algorithm.

Published on 16 Apr 2026 - 7:13

score 127 · Answer 12 · 2026-04-17 03:54:30

127

Views

Shouldn't a breadth first search only take $O(m)$ time?

Published on 17 Apr 2026 - 3:54

score 31 · Answer 13 · 2026-04-16 02:50:59

31

Views

Is there connection between simplex and complete/almost complete/dense graphs?

Published on 16 Apr 2026 - 2:50

score 241 · Answer 14 · 2026-04-17 10:45:37

241

Views

Why does one consider the boundary of trees?

Published on 17 Apr 2026 - 10:45

score 151 · Answer 15 · 2026-03-25 04:40:18

151

Views

Disjoint cycles in a regular multigraph of even degree

Published on 25 Mar 2026 - 4:40

List Question

What are some theorems giving lower bounds on the size of a maximum indepedent set of verticies of a planar graph?

Number of non-isomorphic k-partite graphs.

Is there an efficient way you can draw graceful tree for $n$ points and $n-1$ edges by hand?

Random graph by deleting edges from graph

Show that undirected connected 3-regular graph with 8 vertices has Hamiltonian path

What does it mean to draw a graph on a surface?

Proof of a weaker version of Hall's Marriage Theorem

Number of ways constructing a $k$-clique.

Every block is eulerian graph is eulerian

Number of possible ways n people can meet for lunch on a circular table such that each day no two people sit together who have sat together before?

Number of steps in special graph algorithm.

Shouldn't a breadth first search only take $O(m)$ time?

Is there connection between simplex and complete/almost complete/dense graphs?

Why does one consider the boundary of trees?

Disjoint cycles in a regular multigraph of even degree

Trending Questions

Popular # Hahtags

Popular Questions