List questions from graph-theory

Published on 13 Apr 2026 - 9:48

58

Views

The proof of $|I_X|=\frac{n!}{|\text{Aut}(X)|}$

Published on 14 Apr 2026 - 22:57

696

Views

Making 7 vertices triangle free graph bipartite by deleting an edge

Published on 15 Apr 2026 - 23:56

970

Views

In graph theory, are undirected graphs assumed to be reflexive?

Published on 14 Apr 2026 - 11:53

102

Views

The number of edges this graph

Published on 17 Apr 2026 - 3:06

46

Views

Sperners lemma how to mark internal vertices

Published on 16 Apr 2026 - 9:51

102

Views

Proof in Graph Theory

Published on 14 Apr 2026 - 5:14

337

Views

Some questions on matroid

Published on 12 Apr 2026 - 8:10

571

Views

creating all possible connected graphs with $n$ edges

Published on 17 Apr 2026 - 13:41

265

Views

Graph theory question (on Tournaments)

Published on 17 Apr 2026 - 12:35

131

Views

Vertex/Edge Independence Proof

Published on 12 Apr 2026 - 2:39

62

Views

Is the "smallest" connected graph with $n+k$ edges a trivial generalization of the "smallest" connected graph with $n-1+k$ edges?

Published on 14 Apr 2026 - 16:21

306

Views

I'm not quite sure I understand my book's reasoning for the answer

Published on 15 Apr 2026 - 15:36

472

Views

Are the eigenvectors of vertex transitive graphs bounded

Published on 25 Mar 2026 - 5:06

237

Views

Help with proof that the union of two undirected cycle graphs is a cycle graph (with two edge deletions)

Published on 14 Apr 2026 - 5:02

List Question

Proving a lower bound for the traveling salesman problem

The proof of $|I_X|=\frac{n!}{|\text{Aut}(X)|}$

Making 7 vertices triangle free graph bipartite by deleting an edge

In graph theory, are undirected graphs assumed to be reflexive?

The number of edges this graph

Sperners lemma how to mark internal vertices

Proof in Graph Theory

Some questions on matroid

creating all possible connected graphs with $n$ edges

Graph theory question (on Tournaments)

Vertex/Edge Independence Proof

Is the "smallest" connected graph with $n+k$ edges a trivial generalization of the "smallest" connected graph with $n-1+k$ edges?

I'm not quite sure I understand my book's reasoning for the answer

Are the eigenvectors of vertex transitive graphs bounded

Help with proof that the union of two undirected cycle graphs is a cycle graph (with two edge deletions)

Trending Questions

Popular # Hahtags

Popular Questions