Question

an example for an arbitrary graph $G$ with even vertices which $\forall S \in V(G) , |N(S)|\geq |S| $ but there is no complete matching .

score 102 · Answer 1 · 2026-04-16 04:28:23

an example for an arbitrary graph $G$ with even vertices which $\forall S \in V(G) , |N(S)|\geq |S| $ but there is no complete matching .

score 2.3k · Answer 2 · 2026-04-15 18:41:41

2.3k

Views

Existence of a maximum matching containing a vertex $v$ in a graph

Published on 15 Apr 2026 - 18:41

score 1.3k · Answer 3 · 2026-04-15 20:12:50

1.3k

Views

suppose a graph $G$ is 3-regular with bridge (cut edge),do we have $\chi^{'}(G)=4$?

Published on 15 Apr 2026 - 20:12

score 98 · Answer 4 · 2026-05-10 21:16:52

98

Views

Graph theory and tree company

Published on 10 May 2026 - 21:16

score 1.2k · Answer 5 · 2026-04-15 11:33:09

1.2k

Views

Prove: Graph in which every pair of vertices has an odd number of common neighbors is Eulerian.

Published on 15 Apr 2026 - 11:33

score 770 · Answer 6 · 2026-04-14 10:55:15

770

Views

Calculating interaction beween 100 objects with each other.

Published on 14 Apr 2026 - 10:55

score 208 · Answer 7 · 2026-04-13 13:31:46

208

Views

Is there any regular polyhedron that is not of Euler characteristic 2

Published on 13 Apr 2026 - 13:31

score 2.1k · Answer 8 · 2026-04-17 05:07:17

2.1k

Views

Is there a 5-regular graph of order 7?

Published on 17 Apr 2026 - 5:07

score 5.1k · Answer 9 · 2026-05-11 08:39:16

5.1k

Views

Powers of adjacency matrix doesn't seem to correspond to observed number of paths on graph

Published on 11 May 2026 - 8:39

score 468 · Answer 10 · 2026-04-14 20:04:54

468

Views

What is the relation between linear subgraph and matching polynomial?

Published on 14 Apr 2026 - 20:04

score 97 · Answer 11 · 2026-04-13 16:56:28

97

Views

Two finite graphs with n vertices: Can one have both more components and more edges than the other?

Published on 13 Apr 2026 - 16:56

score 118 · Answer 12 · 2026-03-25 17:42:21

118

Views

give an example to show it is possible to remove one vertex and the multiplicity of one of eigenvalue rise.

Published on 25 Mar 2026 - 17:42

score 166 · Answer 13 · 2026-05-14 03:58:53

166

Views

List (of) all cubic planar graph with 30 vertices

Published on 14 May 2026 - 3:58

score 212 · Answer 14 · 2026-04-13 00:32:55

212

Views

Finding all planar graphs with more regions than edges.

Published on 13 Apr 2026 - 0:32

score 1.5k · Answer 15 · 2026-04-16 02:32:46

1.5k

Views

suppose $n$ people are in a party and every two of them have exactly one common friends,prove that there is one who is friend to all.

Published on 16 Apr 2026 - 2:32

List Question

an example for an arbitrary graph $G$ with even vertices which $\forall S \in V(G) , |N(S)|\geq |S| $ but there is no complete matching .

Existence of a maximum matching containing a vertex $v$ in a graph

suppose a graph $G$ is 3-regular with bridge (cut edge),do we have $\chi^{'}(G)=4$?

Graph theory and tree company

Prove: Graph in which every pair of vertices has an odd number of common neighbors is Eulerian.

Calculating interaction beween 100 objects with each other.

Is there any regular polyhedron that is not of Euler characteristic 2

Is there a 5-regular graph of order 7?

Powers of adjacency matrix doesn't seem to correspond to observed number of paths on graph

What is the relation between linear subgraph and matching polynomial?

Two finite graphs with n vertices: Can one have both more components and more edges than the other?

give an example to show it is possible to remove one vertex and the multiplicity of one of eigenvalue rise.

List (of) all cubic planar graph with 30 vertices

Finding all planar graphs with more regions than edges.

suppose $n$ people are in a party and every two of them have exactly one common friends,prove that there is one who is friend to all.

Trending Questions

Popular # Hahtags

Popular Questions