List questions from graph-theory

Published on 25 Mar 2026 - 9:37

800

Views

Showing that $n \leq \chi(G)\chi(G')$ and $\chi(G') + \chi(G) \geq 2\sqrt n$.

Published on 10 Apr 2019 - 1:28

248

Views

Modification of graph coloring

Published on 10 Apr 2019 - 6:01

172

Views

The minor relation on infinite graphs.

Published on 06 Apr 2026 - 19:36

357

Views

Prove that chromatic number $\geq \frac{V^2}{V^2-2E}$

Published on 10 Apr 2019 - 7:22

170

Views

Prove that for all trees G = (V, Ε) and all vertices $c\in V$, if υ has at least two neighbours, then ν is a cut vertex of G using induction.

Published on 31 Mar 2026 - 22:26

554

Views

Use of weights in Dijkstra algorithm

Published on 01 Apr 2026 - 9:31

172

Views

Using extremal graph theory theorem to prove a theorem in planar graphs

Published on 26 Mar 2026 - 3:00

526

Views

Max Flow with aggregated edge capacities

Published on 25 Mar 2026 - 9:22

556

Views

Eigenvalues of path graph $P_n$ from eigenvalues of a cycle graph $C_{2n}$

Published on 25 Mar 2026 - 7:43

898

Views

Expected number of vertices of a given degree in a random graph

Published on 26 Mar 2026 - 3:06

59

Views

Predicates and mathematical objects

Published on 25 Mar 2026 - 20:40

947

Views

If G is a graph such that any two vertices of G are connected by exactly one path, then G is a tree.

Published on 11 Apr 2019 - 0:26

246

Views

Handshake Lemma/Pigeonhole Principle

Published on 25 Mar 2026 - 21:47

133

Views

Knights and knaves on a square grid

Published on 11 Apr 2019 - 1:23

List Question

How to write the optimization constraint of the following problem

Showing that $n \leq \chi(G)\chi(G')$ and $\chi(G') + \chi(G) \geq 2\sqrt n$.

Modification of graph coloring

The minor relation on infinite graphs.

Prove that chromatic number $\geq \frac{V^2}{V^2-2E}$

Prove that for all trees G = (V, Ε) and all vertices $c\in V$, if υ has at least two neighbours, then ν is a cut vertex of G using induction.

Use of weights in Dijkstra algorithm

Using extremal graph theory theorem to prove a theorem in planar graphs

Max Flow with aggregated edge capacities

Eigenvalues of path graph $P_n$ from eigenvalues of a cycle graph $C_{2n}$

Expected number of vertices of a given degree in a random graph

Predicates and mathematical objects

If G is a graph such that any two vertices of G are connected by exactly one path, then G is a tree.

Handshake Lemma/Pigeonhole Principle

Knights and knaves on a square grid

Trending Questions

Popular # Hahtags

Popular Questions