New posts in graph-theory

Help with graph induction question?

Formal definition of "planar graph"

∗∗Prove that each graph with an even number of vertices has two vertices with an even number of common neighbors.

Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.

Proving every tree has at most one perfect matching

If $G$ is a connected graph with $n$ vertices and $n - 1$ edges then $G$ is a tree, using Induction.

Vertex-transitive graphs and deletion of vertices

How does the size of an n-ball (of a graph) scale as a function of n for various centers of the ball

How to find whether it is possible for each vertex of a graph to have a different degree?

Giving a 1-hour talk to highschool math club: any topic suggestion?

Example of a simple graph isomorphic to a permutation group.

Are all isomorphisms between the Fano plane and its dual of order two?

Spectrum of adjacency matrix of complete graph

Powers of adjacency matrix doesn't seem to correspond to observed number of paths on graph

Lower bound for monochromatic triangles in $K_n$

Alternative proof Hall's marriage explanation

In a graph, can an edge be in less than 2 faces?

Ramsey Number R(4,4)

Showing there is a node in the graph with one and only one edge

A magic trick - find out the fifth card if four is given