Question

What is the intuition for point-set topological inclusion vs topological containment?

score 223 · Answer 1 · 2018-08-20 14:40:38

223

Views

What is the intuition for point-set topological inclusion vs topological containment?

Published on 20 Aug 2018 - 14:40

score 881 · Answer 2 · 2018-08-20 15:53:11

881

Views

Perfect matching in a line graph

Published on 20 Aug 2018 - 15:53

score 1.6k · Answer 3 · 2026-03-25 05:01:31

1.6k

Views

Chromatic number in a union of planar graphs

Published on 25 Mar 2026 - 5:01

score 256 · Answer 4 · 2018-08-21 05:21:33

256

Views

Can we find single-source shortest path in a weighted graph having zero-weighted cycle in it?

Published on 21 Aug 2018 - 5:21

score 1.7k · Answer 5 · 2026-03-25 23:16:34

1.7k

Views

Number of labelled trees with exactly 3 leaves

Published on 25 Mar 2026 - 23:16

score 84 · Answer 6 · 2018-08-21 19:34:11

84

Views

Number of vertices in a graph

Published on 21 Aug 2018 - 19:34

score 74 · Answer 7 · 2018-08-21 21:48:51

74

Views

Number of vertices of degree n not connected to vertices of degree 1

Published on 21 Aug 2018 - 21:48

score 409 · Answer 8 · 2026-03-24 23:53:27

409

Views

How tough is this graph?

Published on 24 Mar 2026 - 23:53

score 2.8k · Answer 9 · 2026-04-01 06:32:19

2.8k

Views

Doubt with proof of if $G$ is simple and $\delta\geq\frac{n-1}2$, then $G$ is connected

Published on 01 Apr 2026 - 6:32

score 3.2k · Answer 10 · 2026-03-25 23:37:48

3.2k

Views

Find a self-complementary graph with $v = 8$. Of the $12, 346$ graphs with $v = 8$ only four are self-complementary.

Published on 25 Mar 2026 - 23:37

score 223 · Answer 11 · 2018-08-22 10:51:31

In a group of $n$ people everybody with a mutual friend know different number of people. Do there exist somebody knowing only one person?

score 142 · Answer 12 · 2018-08-22 13:57:27

142

Views

Arranging sets of parallel lines

Published on 22 Aug 2018 - 13:57

score 219 · Answer 13 · 2018-08-22 17:11:03

Show that if a self-complementary graph contains a pendant vertex, then it must have at least another pendant vertex.

score 1.4k · Answer 14 · 2026-03-26 01:10:19

1.4k

Views

Determine which pairs of graphs below are isomorphic.

Published on 26 Mar 2026 - 1:10

score 20 · Answer 15 · 2018-08-22 19:35:43

20

Views

keep top $k$ weighted edges for each node

Published on 22 Aug 2018 - 19:35

List Question

What is the intuition for point-set topological inclusion vs topological containment?

Perfect matching in a line graph

Chromatic number in a union of planar graphs

Can we find single-source shortest path in a weighted graph having zero-weighted cycle in it?

Number of labelled trees with exactly 3 leaves

Number of vertices in a graph

Number of vertices of degree n not connected to vertices of degree 1

How tough is this graph?

Doubt with proof of if $G$ is simple and $\delta\geq\frac{n-1}2$, then $G$ is connected

Find a self-complementary graph with $v = 8$. Of the $12, 346$ graphs with $v = 8$ only four are self-complementary.

In a group of $n$ people everybody with a mutual friend know different number of people. Do there exist somebody knowing only one person?

Arranging sets of parallel lines

Show that if a self-complementary graph contains a pendant vertex, then it must have at least another pendant vertex.

Determine which pairs of graphs below are isomorphic.

keep top $k$ weighted edges for each node

Trending Questions

Popular # Hahtags

Popular Questions