Question

How many choices do we have, when we choose $i $ edges from a complete bipartite graph such that none of the two selected edges has a common vertex?

score 47 · Answer 1 · 2018-05-17 09:25:43

How many choices do we have, when we choose $i $ edges from a complete bipartite graph such that none of the two selected edges has a common vertex?

score 3.7k · Answer 2 · 2018-05-17 10:06:03

3.7k

Views

Self - complementary graphs with up to 7 vertices

Published on 17 May 2018 - 10:06

score 359 · Answer 3 · 2026-03-25 01:30:05

359

Views

Algorithms for "pleasing" drawings of planar graphs, possibly on sphere

Published on 25 Mar 2026 - 1:30

score 91 · Answer 4 · 2026-03-27 10:34:07

91

Views

Ramsey's theorem exclusion OR?

Published on 27 Mar 2026 - 10:34

score 79 · Answer 5 · 2026-03-25 07:26:31

79

Views

A subclass of regular graphs defined by a property of eigenvectors

Published on 25 Mar 2026 - 7:26

score 43 · Answer 6 · 2018-05-17 22:08:00

43

Views

Rationality condition for strongly $(k,0,3)$ regular graph

Published on 17 May 2018 - 22:08

score 984 · Answer 7 · 2026-03-25 20:15:19

984

Views

Number of labeled trees without a $(1,2)$ edge?

Published on 25 Mar 2026 - 20:15

score 66 · Answer 8 · 2026-03-24 23:45:49

66

Views

A theorem of Brauer on characters and subgroup

Published on 24 Mar 2026 - 23:45

score 112 · Answer 9 · 2018-05-18 09:57:07

112

Views

eulerian path by adding a vertex to a disconnected graph

Published on 18 May 2018 - 9:57

score 1.3k · Answer 10 · 2026-03-26 02:47:38

1.3k

Views

How to determine if a simple graph of $7$ vertices where the degree of each vertex is at least $3$ is connected?

Published on 26 Mar 2026 - 2:47

score 2.5k · Answer 11 · 2026-03-25 04:40:42

2.5k

Views

Rank of Laplacian matrix

Published on 25 Mar 2026 - 4:40

score 435 · Answer 12 · 2026-03-25 07:48:50

435

Views

What is connection between Euler graphs, bipartite graphs and having even number of vertices?

Published on 25 Mar 2026 - 7:48

score 483 · Answer 13 · 2026-03-25 07:56:48

483

Views

Connectedness in Directed Graphs

Published on 25 Mar 2026 - 7:56

score 2.8k · Answer 14 · 2026-03-25 04:40:34

2.8k

Views

Can the degree sequence $2,2,2,2,2,3,3$ be Hamiltonian graph, if not can it be a simple graph?

Published on 25 Mar 2026 - 4:40

score 155 · Answer 15 · 2018-05-18 15:44:58

155

Views

identifying vertex in graph

Published on 18 May 2018 - 15:44

List Question

How many choices do we have, when we choose $i $ edges from a complete bipartite graph such that none of the two selected edges has a common vertex?

Self - complementary graphs with up to 7 vertices

Algorithms for "pleasing" drawings of planar graphs, possibly on sphere

Ramsey's theorem exclusion OR?

A subclass of regular graphs defined by a property of eigenvectors

Rationality condition for strongly $(k,0,3)$ regular graph

Number of labeled trees without a $(1,2)$ edge?

A theorem of Brauer on characters and subgroup

eulerian path by adding a vertex to a disconnected graph

How to determine if a simple graph of $7$ vertices where the degree of each vertex is at least $3$ is connected?

Rank of Laplacian matrix

What is connection between Euler graphs, bipartite graphs and having even number of vertices?

Connectedness in Directed Graphs

Can the degree sequence $2,2,2,2,2,3,3$ be Hamiltonian graph, if not can it be a simple graph?

identifying vertex in graph

Trending Questions

Popular # Hahtags

Popular Questions