Question

Every graph with $n$ vertices and $2n$ edges has a cycle of length at most $2\log_2 n$?

score 588 · Answer 1 · 2018-05-09 13:52:12

588

Views

Every graph with $n$ vertices and $2n$ edges has a cycle of length at most $2\log_2 n$?

Published on 09 May 2018 - 13:52

score 89 · Answer 2 · 2018-05-09 16:12:39

89

Views

$G$ either has a $K_4$ or an independent set of size $3$

Published on 09 May 2018 - 16:12

score 23 · Answer 3 · 2018-05-09 16:34:18

23

Views

Is there an uncountably embeddable graph without flexibility?

Published on 09 May 2018 - 16:34

score 191 · Answer 4 · 2018-05-09 18:20:49

191

Views

difference between matching graph and induced matching graph

Published on 09 May 2018 - 18:20

score 98 · Answer 5 · 2018-05-09 19:07:01

98

Views

When is a directed graph an endofunction

Published on 09 May 2018 - 19:07

score 364 · Answer 6 · 2026-03-25 07:48:49

364

Views

Erdős–Rényi $G(n,p)$ model, probability of given geodesic distance

Published on 25 Mar 2026 - 7:48

score 1.3k · Answer 7 · 2026-03-25 06:00:34

1.3k

Views

When does a complete bipartite graph contains a Hamiltonian cicle?

Published on 25 Mar 2026 - 6:00

score 109 · Answer 8 · 2018-05-10 03:44:50

109

Views

Number of faces in a planar graph

Published on 10 May 2018 - 3:44

score 288 · Answer 9 · 2026-03-25 07:45:41

288

Views

Counting pairs of $k$-cycles with $r$ common edges (Variance of number of $k$-cycles)

Published on 25 Mar 2026 - 7:45

score 122 · Answer 10 · 2026-03-25 03:02:00

122

Views

Is the graph formed by GP series of adjacency matrix, Eulerian?

Published on 25 Mar 2026 - 3:02

score 421 · Answer 11 · 2026-03-27 21:43:05

421

Views

Topological sorting algorithm on a directed graph

Published on 27 Mar 2026 - 21:43

score 24 · Answer 12 · 2018-05-10 20:30:52

24

Views

Is the number of exposed vertices equal for different maximum matchings?

Published on 10 May 2018 - 20:30

score 760 · Answer 13 · 2026-03-25 07:40:48

760

Views

Join of two graphs bipartite?

Published on 25 Mar 2026 - 7:40

score 25 · Answer 14 · 2026-03-25 00:31:54

25

Views

Why is the higlighted equivalence true?

Published on 25 Mar 2026 - 0:31

score 820 · Answer 15 · 2018-05-11 17:37:07

820

Views

What is the probability that a graph containing n nodes with k random edges each will be strongly connected?

Published on 11 May 2018 - 17:37

List Question

Every graph with $n$ vertices and $2n$ edges has a cycle of length at most $2\log_2 n$?

$G$ either has a $K_4$ or an independent set of size $3$

Is there an uncountably embeddable graph without flexibility?

difference between matching graph and induced matching graph

When is a directed graph an endofunction

Erdős–Rényi $G(n,p)$ model, probability of given geodesic distance

When does a complete bipartite graph contains a Hamiltonian cicle?

Number of faces in a planar graph

Counting pairs of $k$-cycles with $r$ common edges (Variance of number of $k$-cycles)

Is the graph formed by GP series of adjacency matrix, Eulerian?

Topological sorting algorithm on a directed graph

Is the number of exposed vertices equal for different maximum matchings?

Join of two graphs bipartite?

Why is the higlighted equivalence true?

What is the probability that a graph containing n nodes with k random edges each will be strongly connected?

Trending Questions

Popular # Hahtags

Popular Questions