Question

Upper bounds for number of $3$-flags in a $(2k, k^2)$-graph $G$

score 25 · Answer 1 · 2026-03-29 08:21:07

25

Views

Upper bounds for number of $3$-flags in a $(2k, k^2)$-graph $G$

Published on 29 Mar 2026 - 8:21

score 105 · Answer 2 · 2026-03-26 01:10:39

105

Views

How many independent even cycles in $G(n,m)$

Published on 26 Mar 2026 - 1:10

score 176 · Answer 3 · 2019-01-07 09:03:05

176

Views

Using Mathematics to find a Checkmate

Published on 07 Jan 2019 - 9:03

score 667 · Answer 4 · 2019-01-07 10:43:28

667

Views

Cayley Graphs of Product groups is product of Cayley Graphs

Published on 07 Jan 2019 - 10:43

score 3.2k · Answer 5 · 2019-01-07 14:16:16

3.2k

Views

What is the Minimum Flow in a graph network (not the min cost flow problem)

Published on 07 Jan 2019 - 14:16

score 52 · Answer 6 · 2019-01-07 15:42:15

52

Views

undirected graphs and Hamiltonian cycles

Published on 07 Jan 2019 - 15:42

score 576 · Answer 7 · 2026-04-05 11:19:18

576

Views

A bipartite graph

Published on 05 Apr 2026 - 11:19

score 369 · Answer 8 · 2026-03-25 09:44:42

369

Views

Algorithm for generating a graph based on a planar graph?

Published on 25 Mar 2026 - 9:44

score 263 · Answer 9 · 2026-04-05 11:38:46

263

Views

Cycle double cover conjecture for complete graphs?

Published on 05 Apr 2026 - 11:38

score 365 · Answer 10 · 2026-03-25 04:42:32

365

Views

Given a graph G: how to find a formula to determine the number of squares in which a vertex participates?

Published on 25 Mar 2026 - 4:42

score 81 · Answer 11 · 2019-01-08 07:07:28

81

Views

Finding corresponding coordinate based on known ordered pair

Published on 08 Jan 2019 - 7:07

score 1.4k · Answer 12 · 2019-01-08 12:18:06

1.4k

Views

4 color theorem equivalent to cubic planar bridgeless are 3 edge colorable

Published on 08 Jan 2019 - 12:18

score 86 · Answer 13 · 2026-03-26 04:51:17

86

Views

Measure of subgraph isomorphisms

Published on 26 Mar 2026 - 4:51

score 448 · Answer 14 · 2019-01-08 15:45:36

Choosing the vertices of a regular hexagon, how many ways are there to form four triangles such that any two triangles share exactly one vertex?

score 1.2k · Answer 15 · 2019-01-08 18:57:45

1.2k

Views

Regular connected graph with at least one bridge.

Published on 08 Jan 2019 - 18:57

List Question

Upper bounds for number of $3$-flags in a $(2k, k^2)$-graph $G$

How many independent even cycles in $G(n,m)$

Using Mathematics to find a Checkmate

Cayley Graphs of Product groups is product of Cayley Graphs

What is the Minimum Flow in a graph network (not the min cost flow problem)

undirected graphs and Hamiltonian cycles

A bipartite graph

Algorithm for generating a graph based on a planar graph?

Cycle double cover conjecture for complete graphs?

Given a graph G: how to find a formula to determine the number of squares in which a vertex participates?

Finding corresponding coordinate based on known ordered pair

4 color theorem equivalent to cubic planar bridgeless are 3 edge colorable

Measure of subgraph isomorphisms

Choosing the vertices of a regular hexagon, how many ways are there to form four triangles such that any two triangles share exactly one vertex?

Regular connected graph with at least one bridge.

Trending Questions

Popular # Hahtags

Popular Questions