Question

For all $n\geq3$ does there always exist an $n$ vertex tournament without induced acyclic subgraphs of size $4$ or more?

score 69 · Answer 1 · 2019-03-28 22:57:47

69

Views

For all $n\geq3$ does there always exist an $n$ vertex tournament without induced acyclic subgraphs of size $4$ or more?

Published on 28 Mar 2019 - 22:57

score 189 · Answer 2 · 2026-03-25 11:32:58

189

Views

By Kuratowski's theorem this graph seems to be planar so why is it 5 colourable considering the Four Colour theorem?

Published on 25 Mar 2026 - 11:32

score 58 · Answer 3 · 2019-03-28 23:51:08

58

Views

Bijection between leaf-free subgraphs of the Möbius ladder and the ladder graph.

Published on 28 Mar 2019 - 23:51

score 497 · Answer 4 · 2026-03-25 01:41:15

497

Views

Largest eigenvalue of the Laplacian Matrix in an odd cycle

Published on 25 Mar 2026 - 1:41

score 174 · Answer 5 · 2019-03-29 01:14:27

For an $n$-tournament, what's a tight upper bound for the minimum number of transitive sub tournaments needed to edge cover it?

score 58 · Answer 6 · 2026-03-25 11:04:42

58

Views

Change to spectral radius due to removal of a single vertex from graph

Published on 25 Mar 2026 - 11:04

score 34 · Answer 7 · 2026-03-25 06:17:54

34

Views

A scheduling problem on an oriented graph with multiple constraints

Published on 25 Mar 2026 - 6:17

score 34 · Answer 8 · 2019-03-29 14:36:56

Is it normal that a node in a weighted directed graph gets a higher measure of betwenness centrality when its edge weights are lower?

score 64 · Answer 9 · 2019-03-29 20:04:47

64

Views

What is the term for a collection of vertices in a graph that are all mutually connected to one another?

Published on 29 Mar 2019 - 20:04

score 754 · Answer 10 · 2019-03-30 09:26:11

754

Views

Consider a triangle-free graph $G:|V(G)|=n$ and show that $\chi{(G)}\leq\lfloor 2\sqrt{n}\rfloor$

Published on 30 Mar 2019 - 9:26

score 59 · Answer 11 · 2026-03-25 13:54:09

59

Views

How can I prove that this two statements are equivalent?

Published on 25 Mar 2026 - 13:54

score 114 · Answer 12 · 2026-03-25 12:49:05

114

Views

Apparent paradox on d-separation and conditioning in Bayesian Networks

Published on 25 Mar 2026 - 12:49

score 2.7k · Answer 13 · 2026-03-27 04:30:52

2.7k

Views

Ramsey Number $R(4,4) = 18$

Published on 27 Mar 2026 - 4:30

score 64 · Answer 14 · 2026-03-25 23:16:27

64

Views

A question about groups, that are isomorphic to the automorphism groups of their cycle graphs

Published on 25 Mar 2026 - 23:16

score 68 · Answer 15 · 2019-03-31 00:40:55

68

Views

For an $n$ dimensional hypercube, how many corner points are required such that all other corner points are at most 1 edge away

Published on 31 Mar 2019 - 0:40

List Question

For all $n\geq3$ does there always exist an $n$ vertex tournament without induced acyclic subgraphs of size $4$ or more?

By Kuratowski's theorem this graph seems to be planar so why is it 5 colourable considering the Four Colour theorem?

Bijection between leaf-free subgraphs of the Möbius ladder and the ladder graph.

Largest eigenvalue of the Laplacian Matrix in an odd cycle

For an $n$-tournament, what's a tight upper bound for the minimum number of transitive sub tournaments needed to edge cover it?

Change to spectral radius due to removal of a single vertex from graph

A scheduling problem on an oriented graph with multiple constraints

Is it normal that a node in a weighted directed graph gets a higher measure of betwenness centrality when its edge weights are lower?

What is the term for a collection of vertices in a graph that are all mutually connected to one another?

Consider a triangle-free graph $G:|V(G)|=n$ and show that $\chi{(G)}\leq\lfloor 2\sqrt{n}\rfloor$

How can I prove that this two statements are equivalent?

Apparent paradox on d-separation and conditioning in Bayesian Networks

Ramsey Number $R(4,4) = 18$

A question about groups, that are isomorphic to the automorphism groups of their cycle graphs

For an $n$ dimensional hypercube, how many corner points are required such that all other corner points are at most 1 edge away

Trending Questions

Popular # Hahtags

Popular Questions