Question

Writing cycles of a graph as a linear combination of fundamental cycles

score 349 · Answer 1 · 2026-03-25 09:06:54

349

Views

Writing cycles of a graph as a linear combination of fundamental cycles

Published on 25 Mar 2026 - 9:06

score 51 · Answer 2 · 2018-10-17 02:45:23

51

Views

maximum number of perfect matchings of $K_{2n}$ such that no edge appears in two different matchings

Published on 17 Oct 2018 - 2:45

score 3.9k · Answer 3 · 2018-10-17 04:01:19

3.9k

Views

Let G be a graph with n vertices where every vertex has a degree of at least n/2. Prove that G is connected.

Published on 17 Oct 2018 - 4:01

score 707 · Answer 4 · 2018-10-17 04:33:27

707

Views

Finding Components in Complement of Graph

Published on 17 Oct 2018 - 4:33

score 139 · Answer 5 · 2018-10-17 06:21:45

139

Views

No. of ways to put 1's in exactly K cell of 2*N grid such that no two 1's cell share adjacent side

Published on 17 Oct 2018 - 6:21

score 36 · Answer 6 · 2026-03-25 22:39:52

36

Views

How to randomly sample a social graph to find paths between at least 20% of profiles?

Published on 25 Mar 2026 - 22:39

score 7k · Answer 7 · 2026-03-27 16:32:10

7k

Views

Laplacian of a directed weighted graph

Published on 27 Mar 2026 - 16:32

score 35 · Answer 8 · 2026-03-25 19:02:16

35

Views

An (sort of) inverse Dirichlet problem

Published on 25 Mar 2026 - 19:02

score 108 · Answer 9 · 2026-03-27 12:00:31

108

Views

Network Connectivity Problem

Published on 27 Mar 2026 - 12:00

score 39 · Answer 10 · 2026-03-25 06:24:53

39

Views

Given graph $G$ that is "close" to another graph $G'$ can we find certain bipartite subgraph of $G$

Published on 25 Mar 2026 - 6:24

score 87 · Answer 11 · 2018-10-18 03:06:17

87

Views

Combinatorial Sum equals $2n^{n-3}$

Published on 18 Oct 2018 - 3:06

score 292 · Answer 12 · 2026-03-25 06:05:38

292

Views

How can I get maximum number of vertices if I already know edges

Published on 25 Mar 2026 - 6:05

score 36 · Answer 13 · 2026-03-25 13:34:27

36

Views

G=(V,E) a graph that that maintains this condition $\left |E \right |\geq \left | V \right |\geq \left |3 \right |$ must have a circle

Published on 25 Mar 2026 - 13:34

score 2.1k · Answer 14 · 2018-10-18 19:31:00

2.1k

Views

Given a simple graph and its complement. Prove that either of them has a cycle.

Published on 18 Oct 2018 - 19:31

score 373 · Answer 15 · 2018-10-18 20:55:48

373

Views

Prove that a simple connected graph with exactly 2 cut vertices has a cut edge

Published on 18 Oct 2018 - 20:55

List Question

Writing cycles of a graph as a linear combination of fundamental cycles

maximum number of perfect matchings of $K_{2n}$ such that no edge appears in two different matchings

Let G be a graph with n vertices where every vertex has a degree of at least n/2. Prove that G is connected.

Finding Components in Complement of Graph

No. of ways to put 1's in exactly K cell of 2*N grid such that no two 1's cell share adjacent side

How to randomly sample a social graph to find paths between at least 20% of profiles?

Laplacian of a directed weighted graph

An (sort of) inverse Dirichlet problem

Network Connectivity Problem

Given graph $G$ that is "close" to another graph $G'$ can we find certain bipartite subgraph of $G$

Combinatorial Sum equals $2n^{n-3}$

How can I get maximum number of vertices if I already know edges

G=(V,E) a graph that that maintains this condition $\left |E \right |\geq \left | V \right |\geq \left |3 \right |$ must have a circle

Given a simple graph and its complement. Prove that either of them has a cycle.

Prove that a simple connected graph with exactly 2 cut vertices has a cut edge

Trending Questions

Popular # Hahtags

Popular Questions