Question

Serial version of Hall's marriage theorem?

score 191 · Answer 1 · 2026-04-14 16:49:11

191

Views

Serial version of Hall's marriage theorem?

Published on 14 Apr 2026 - 16:49

score 795 · Answer 2 · 2026-04-17 16:00:30

795

Views

Prove that a graph $G$ has an Eulerian orientation if and only if $G$ is Eulerian

Published on 17 Apr 2026 - 16:00

score 460 · Answer 3 · 2026-04-17 00:24:56

460

Views

Orientation digraph question

Published on 17 Apr 2026 - 0:24

score 616 · Answer 4 · 2026-04-16 01:40:39

616

Views

Counting the number of complete bipartite subgraphs

Published on 16 Apr 2026 - 1:40

score 517 · Answer 5 · 2026-04-16 08:38:52

Prove that if $G$ is an nontrivial connected graph with at most 2 bridges, then there exists an orientation $D$

score 46 · Answer 6 · 2026-04-15 23:19:04

46

Views

Proof verification that two spanning tress of the same graph are the same size

Published on 15 Apr 2026 - 23:19

score 11.9k · Answer 7 · 2026-04-14 16:10:45

11.9k

Views

Proof: How many edges need be removed from this graph to produce the spanning tree?

Published on 14 Apr 2026 - 16:10

score 914 · Answer 8 · 2026-04-16 14:38:39

914

Views

Prove that wheel (Wn) graph family are hamiltonian

Published on 16 Apr 2026 - 14:38

score 199 · Answer 9 · 2026-04-14 11:08:04

199

Views

Is there a name for a graph homomorphism that is almost subgraph isomorphic but allows multiple nodes to map to the same node?

Published on 14 Apr 2026 - 11:08

score 85 · Answer 10 · 2026-04-12 04:26:01

85

Views

"Polysticks" in 3d

Published on 12 Apr 2026 - 4:26

score 50 · Answer 11 · 2026-04-15 15:37:57

50

Views

Existence of $K_{\log n}$ as minor

Published on 15 Apr 2026 - 15:37

score 49 · Answer 12 · 2026-04-15 17:13:03

Prove that if $r(x)≠r(y)$ for every 2 distinct vertices $x$ and $y$ of $D$ then $D$ contain a Hamiltonian path.

score 791 · Answer 13 · 2026-04-15 04:34:00

791

Views

Prove: G is Bipartite with bipartition(x,y) where |x| not equal |y|, then G is nonhamiltonian?

Published on 15 Apr 2026 - 4:34

score 102 · Answer 14 · 2026-04-16 02:13:50

Show that that there exists a digraph $D$ such that both $od(v)$ and $id(v) $ are at least $\frac{n-1}{2}$ but $D$ is not Hamiltonian.

score 677 · Answer 15 · 2026-04-15 17:43:40

677

Views

How many trees are in an n-cycle? (graph theory)

Published on 15 Apr 2026 - 17:43

List Question

Serial version of Hall's marriage theorem?

Prove that a graph $G$ has an Eulerian orientation if and only if $G$ is Eulerian

Orientation digraph question

Counting the number of complete bipartite subgraphs

Prove that if $G$ is an nontrivial connected graph with at most 2 bridges, then there exists an orientation $D$

Proof verification that two spanning tress of the same graph are the same size

Proof: How many edges need be removed from this graph to produce the spanning tree?

Prove that wheel (Wn) graph family are hamiltonian

Is there a name for a graph homomorphism that is almost subgraph isomorphic but allows multiple nodes to map to the same node?

"Polysticks" in 3d

Existence of $K_{\log n}$ as minor

Prove that if $r(x)≠r(y)$ for every 2 distinct vertices $x$ and $y$ of $D$ then $D$ contain a Hamiltonian path.

Prove: G is Bipartite with bipartition(x,y) where |x| not equal |y|, then G is nonhamiltonian?

Show that that there exists a digraph $D$ such that both $od(v)$ and $id(v) $ are at least $\frac{n-1}{2}$ but $D$ is not Hamiltonian.

How many trees are in an n-cycle? (graph theory)

Trending Questions

Popular # Hahtags

Popular Questions