List questions from graph-theory

Published on 25 Mar 2026 - 15:50

1.7k

Views

Graph Theory: Degree of regions in a planar graph

Published on 17 Mar 2026 - 19:22

84

Views

Shape of the graph spectrum

Published on 23 Mar 2026 - 5:09

96

Views

Integrality gap of maximum weighted clique

Published on 23 Mar 2026 - 12:38

58

Views

Let $G$ be a planar graph with $n$ vertices, then $\lambda_1(G) \leq −3 \lambda_n(G)$.

Published on 23 Mar 2026 - 10:43

224

Views

Why repeated squaring and scaling a graph adjacency matrix yields a rank 1 projector?

Published on 22 Mar 2026 - 18:34

149

Views

Which infinite graphs have finite clique number?

Published on 30 Jan 2018 - 10:59

911

Views

Prove that edge $e$ is a cut edge in graph $G$ iff $e$ is not in every circle in the graph

Published on 30 Jan 2018 - 14:37

228

Views

Graph algorithms or properties for preserving the topological sort

Published on 23 Mar 2026 - 6:06

1.8k

Views

Example of non-simple cycle in a directed graph

Published on 30 Jan 2018 - 19:55

452

Views

For every $n\in \Bbb{N}$ there exists a graph with $2n$ vertices with the degrees: $1, 1, 2, 2, 3, 3 \dots n, n$

Published on 30 Jan 2018 - 20:43

213

Views

Counting labelled graphs with k edges and n vertices

Published on 30 Jan 2018 - 22:28

34

Views

Reverse order of summation for function on edges of a graph

Published on 31 Jan 2018 - 1:36

367

Views

Use the definition of matrix multiplication to explain why the analogous result holds for any entry of Adjacency Matrix $A^2$.

Published on 22 Mar 2026 - 13:14

405

Views

Bass-Serre tree of Isom($\mathbb{Z}$)

Published on 20 Mar 2026 - 4:42

List Question

Graph Theory: Euler Trail and Euler Graph

Graph Theory: Degree of regions in a planar graph

Shape of the graph spectrum

Integrality gap of maximum weighted clique

Let $G$ be a planar graph with $n$ vertices, then $\lambda_1(G) \leq −3 \lambda_n(G)$.

Why repeated squaring and scaling a graph adjacency matrix yields a rank 1 projector?

Which infinite graphs have finite clique number?

Prove that edge $e$ is a cut edge in graph $G$ iff $e$ is not in every circle in the graph

Graph algorithms or properties for preserving the topological sort

Example of non-simple cycle in a directed graph

For every $n\in \Bbb{N}$ there exists a graph with $2n$ vertices with the degrees: $1, 1, 2, 2, 3, 3 \dots n, n$

Counting labelled graphs with k edges and n vertices

Reverse order of summation for function on edges of a graph

Use the definition of matrix multiplication to explain why the analogous result holds for any entry of Adjacency Matrix $A^2$.

Bass-Serre tree of Isom($\mathbb{Z}$)

Trending Questions

Popular # Hahtags

Popular Questions