Question

Graph Theory: prove the defect version of Hall's theorem

score 525 · Answer 1 · 2015-01-10 12:57:00

525

Views

Graph Theory: prove the defect version of Hall's theorem

Published on 10 Jan 2015 - 12:57

score 208 · Answer 2 · 2026-03-26 08:00:44

208

Views

Choosing which sets of nodes are 'top' and 'bottom' in bipartite graph representations of real-world complex networks.

Published on 26 Mar 2026 - 8:00

score 283 · Answer 3 · 2026-03-28 20:14:12

283

Views

What is the smallest planar cubic bipartite asymmetric graph?

Published on 28 Mar 2026 - 20:14

score 13.3k · Answer 4 · 2015-01-29 05:15:58

13.3k

Views

Complement of a bipartite graph

Published on 29 Jan 2015 - 5:15

score 277 · Answer 5 · 2015-02-01 18:31:24

277

Views

Bipartite graph with $2 \times 10^{6}$ vertices, I need help with removing edges from the graph.

Published on 01 Feb 2015 - 18:31

score 756 · Answer 6 · 2026-03-26 11:04:27

756

Views

Usage of the term "perfect matching" for bipartite graphs

Published on 26 Mar 2026 - 11:04

score 1.9k · Answer 7 · 2015-02-17 03:19:04

1.9k

Views

Finding the spanning subgraphs of a complete bipartite graph

Published on 17 Feb 2015 - 3:19

score 636 · Answer 8 · 2026-03-26 22:53:16

636

Views

Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?

Published on 26 Mar 2026 - 22:53

score 236 · Answer 9 · 2015-02-22 15:00:34

236

Views

Using Polya Enumeration Theorem to find the number of spanning subgraphs of a complete bipartite graph

Published on 22 Feb 2015 - 15:00

score 734 · Answer 10 · 2015-03-01 21:29:04

734

Views

How many possible combinations of a bipartite graph given a degree constraint on one side?

Published on 01 Mar 2015 - 21:29

score 685 · Answer 11 · 2015-03-16 21:48:14

685

Views

Complete bipartite subgraph in Kneser graph

Published on 16 Mar 2015 - 21:48

score 671 · Answer 12 · 2015-03-21 13:10:12

671

Views

Using Hall's Theorem

Published on 21 Mar 2015 - 13:10

score 1.3k · Answer 13 · 2026-03-26 11:06:07

1.3k

Views

bipartite graph has perfect matching

Published on 26 Mar 2026 - 11:06

score 1.3k · Answer 14 · 2026-03-26 11:05:38

1.3k

Views

Using Hall's Theorem to show something.

Published on 26 Mar 2026 - 11:05

score 1.5k · Answer 15 · 2015-04-01 22:03:05

1.5k

Views

Prove that for $n\ge 2$, the $n$-cube has at least $2^{2^{n-2}}$ perfect matchings

Published on 01 Apr 2015 - 22:03

List Question

Graph Theory: prove the defect version of Hall's theorem

Choosing which sets of nodes are 'top' and 'bottom' in bipartite graph representations of real-world complex networks.

What is the smallest planar cubic bipartite asymmetric graph?

Complement of a bipartite graph

Bipartite graph with $2 \times 10^{6}$ vertices, I need help with removing edges from the graph.

Usage of the term "perfect matching" for bipartite graphs

Finding the spanning subgraphs of a complete bipartite graph

Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?

Using Polya Enumeration Theorem to find the number of spanning subgraphs of a complete bipartite graph

How many possible combinations of a bipartite graph given a degree constraint on one side?

Complete bipartite subgraph in Kneser graph

Using Hall's Theorem

bipartite graph has perfect matching

Using Hall's Theorem to show something.

Prove that for $n\ge 2$, the $n$-cube has at least $2^{2^{n-2}}$ perfect matchings

Trending Questions

Popular # Hahtags

Popular Questions