Question

Graph isomorphic to its complement

score 529 · Answer 1 · 2026-04-17 00:48:31

529

Views

Graph isomorphic to its complement

Published on 17 Apr 2026 - 0:48

score 2.5k · Answer 2 · 2026-04-12 11:48:18

2.5k

Views

what is Path and how to find number of possible paths of length $r$

Published on 12 Apr 2026 - 11:48

score 63 · Answer 3 · 2026-04-12 05:53:53

63

Views

Connectivity of bipartite graph.

Published on 12 Apr 2026 - 5:53

score 212 · Answer 4 · 2019-10-28 10:03:53

212

Views

4 color theorem, attempted disproof

Published on 28 Oct 2019 - 10:03

score 50 · Answer 5 · 2026-04-16 12:44:22

50

Views

Show that $n \geq \Delta(G)+\delta(G),$ for a graph $G$ of order $n$ with no $C_3.$

Published on 16 Apr 2026 - 12:44

score 425 · Answer 6 · 2026-04-17 02:18:46

If $G$ is a graph of order $n\geq 2$ such that $\delta(G) \geq \frac{1}{2}(n-1),$ then any two non-adjacent vertices in $G$ have a common neighbour.

score 325 · Answer 7 · 2026-04-16 16:48:24

325

Views

If $G$ is a $(n,m)$ graph such that $\Delta(G)=n-2$ and any two non-adjacent vertices have a common neighbour, then $m\geq 2n-4.$

Published on 16 Apr 2026 - 16:48

score 133 · Answer 8 · 2026-05-11 01:13:06

133

Views

Let $n\ge 3$. $n$ Canadians and $n$ Thailanders are playing in a tournament.

Published on 11 May 2026 - 1:13

score 208 · Answer 9 · 2026-04-16 14:47:36

208

Views

Connected graph with no triangle

Published on 16 Apr 2026 - 14:47

score 334 · Answer 10 · 2026-03-25 17:41:49

334

Views

$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least $10000$ others.

Published on 25 Mar 2026 - 17:41

score 89 · Answer 11 · 2026-03-26 14:31:52

89

Views

A simple problem about edge bicolored complete graphs

Published on 26 Mar 2026 - 14:31

score 185 · Answer 12 · 2026-04-17 07:11:21

185

Views

Hitori and graph connectivity

Published on 17 Apr 2026 - 7:11

score 217 · Answer 13 · 2026-04-15 18:17:14

217

Views

Length of a cycle is $3k$ if every cycle has length of $\geq 5$

Published on 15 Apr 2026 - 18:17

score 364 · Answer 14 · 2026-04-16 04:15:47

364

Views

How to prove that in any finite graph, the number of vertices with odd degree is even

Published on 16 Apr 2026 - 4:15

score 108 · Answer 15 · 2026-03-26 14:28:05

108

Views

A problem about edge bicolored complete graphs 2

Published on 26 Mar 2026 - 14:28

List Question

Graph isomorphic to its complement

what is Path and how to find number of possible paths of length $r$

Connectivity of bipartite graph.

4 color theorem, attempted disproof

Show that $n \geq \Delta(G)+\delta(G),$ for a graph $G$ of order $n$ with no $C_3.$

If $G$ is a graph of order $n\geq 2$ such that $\delta(G) \geq \frac{1}{2}(n-1),$ then any two non-adjacent vertices in $G$ have a common neighbour.

If $G$ is a $(n,m)$ graph such that $\Delta(G)=n-2$ and any two non-adjacent vertices have a common neighbour, then $m\geq 2n-4.$

Let $n\ge 3$. $n$ Canadians and $n$ Thailanders are playing in a tournament.

Connected graph with no triangle

$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least $10000$ others.

A simple problem about edge bicolored complete graphs

Hitori and graph connectivity

Length of a cycle is $3k$ if every cycle has length of $\geq 5$

How to prove that in any finite graph, the number of vertices with odd degree is even

A problem about edge bicolored complete graphs 2

Trending Questions

Popular # Hahtags

Popular Questions