Question

Prove G simple and bipartite has perfect match if $|X|=|Y|=k, |E(G)| > k * (k - 1)$

score 345 · Answer 1 · 2019-05-08 17:41:30

345

Views

Prove G simple and bipartite has perfect match if $|X|=|Y|=k, |E(G)| > k * (k - 1)$

Published on 08 May 2019 - 17:41

score 1.1k · Answer 2 · 2026-03-25 16:05:53

1.1k

Views

Does every Euler circuit pass through all vertices?

Published on 25 Mar 2026 - 16:05

score 1.2k · Answer 3 · 2026-03-25 09:43:13

1.2k

Views

Show that the connected components of a graph induced by the symmetric difference of two perfect matchings are a cycle.

Published on 25 Mar 2026 - 9:43

score 51 · Answer 4 · 2026-03-27 10:34:24

51

Views

Does a (complete) $\mathfrak{a}$-partite graph always have a maximum in AND out degree?

Published on 27 Mar 2026 - 10:34

score 44 · Answer 5 · 2026-04-07 05:02:35

44

Views

Is there a sufficiently large vertex set in a 3-uniform hypergraph, which satisfies the following condition?

Published on 07 Apr 2026 - 5:02

score 81 · Answer 6 · 2026-03-25 15:47:22

81

Views

How do we know that the prime sum graph defined in this paper has a perfect matching?

Published on 25 Mar 2026 - 15:47

score 408 · Answer 7 · 2026-04-10 21:19:59

408

Views

How to find the vertices of one component in a min-cut problem?

Published on 10 Apr 2026 - 21:19

score 386 · Answer 8 · 2026-03-26 14:22:36

386

Views

A tree in which all subtrees are of size $2^k-1\;$ for some $\;k\in\mathbb N$ is balanced

Published on 26 Mar 2026 - 14:22

score 124 · Answer 9 · 2019-05-09 16:49:07

124

Views

Graceful labeling of friendship graph

Published on 09 May 2019 - 16:49

score 76 · Answer 10 · 2019-05-09 19:41:49

76

Views

Crossing number of a graph with an additional edge

Published on 09 May 2019 - 19:41

score 197 · Answer 11 · 2019-05-09 20:24:08

Neatly draw two graphs with at least five vertices with the same degree sequence, where one is a tree and the other is not a tree.

score 73 · Answer 12 · 2026-04-10 23:21:38

73

Views

$K_{3,3}$ is not a proper subgraph of a subdivision of $K_{3,3}$

Published on 10 Apr 2026 - 23:21

score 260 · Answer 13 · 2019-05-09 21:11:55

260

Views

How many (non-isomorphic) graphs are there with a given degree sequence?

Published on 09 May 2019 - 21:11

score 2.1k · Answer 14 · 2026-03-25 09:28:31

2.1k

Views

Spectra of adjacency matrices of bipartite graphs

Published on 25 Mar 2026 - 9:28

score 97 · Answer 15 · 2026-03-27 04:23:33

97

Views

Time complexity of finding neighbors of specific nodes within a threshold in a weighted graph

Published on 27 Mar 2026 - 4:23

List Question

Prove G simple and bipartite has perfect match if $|X|=|Y|=k, |E(G)| > k * (k - 1)$

Does every Euler circuit pass through all vertices?

Show that the connected components of a graph induced by the symmetric difference of two perfect matchings are a cycle.

Does a (complete) $\mathfrak{a}$-partite graph always have a maximum in AND out degree?

Is there a sufficiently large vertex set in a 3-uniform hypergraph, which satisfies the following condition?

How do we know that the prime sum graph defined in this paper has a perfect matching?

How to find the vertices of one component in a min-cut problem?

A tree in which all subtrees are of size $2^k-1\;$ for some $\;k\in\mathbb N$ is balanced

Graceful labeling of friendship graph

Crossing number of a graph with an additional edge

Neatly draw two graphs with at least five vertices with the same degree sequence, where one is a tree and the other is not a tree.

$K_{3,3}$ is not a proper subgraph of a subdivision of $K_{3,3}$

How many (non-isomorphic) graphs are there with a given degree sequence?

Spectra of adjacency matrices of bipartite graphs

Time complexity of finding neighbors of specific nodes within a threshold in a weighted graph

Trending Questions

Popular # Hahtags

Popular Questions