Newbetuts

For all $1 \leq i < j \leq k$, the subtrees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree?

Returning Paths on Cubic Graphs Without Backtracking

What is difference between cycle, path and circuit in Graph Theory

Is Sage on the same level as Mathematica or Matlab for graph theory and graph visualization?

What is the optimal path between $2$ fixed points around an invisible obstructing wall?

Exact probability of random graph being connected

Finding all cycles in a directed graph

Why a complete graph has $\frac{n(n-1)}{2}$ edges?

How does the divisibility graphs work?

What's the relation between topology and graph theory

Given a simple graph and its complement, prove that either of them is always connected.

Are resistor-battery networks always uniquely solvable?

When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]

Proof a graph is bipartite if and only if it contains no odd cycles

Computing the expected size of the largest connected component in a "hitomezashi graph" (described in the question body)

How does TREE(3) grow to get so big? (Laymen explanation)

Best algorithm for detecting cycles in a directed graph [closed]

New posts in graph-theory

How to calculate the number of possible connected simple graphs with $n$ labelled vertices

Can every d-regular graph be decomposed into at most d+1 matchings?

For all $1 \leq i < j \leq k$, the subtrees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree?

Returning Paths on Cubic Graphs Without Backtracking

What is difference between cycle, path and circuit in Graph Theory

Is Sage on the same level as Mathematica or Matlab for graph theory and graph visualization?

What is the optimal path between $2$ fixed points around an invisible obstructing wall?

Exact probability of random graph being connected

Finding all cycles in a directed graph

Why a complete graph has $\frac{n(n-1)}{2}$ edges?

How does the divisibility graphs work?

What's the relation between topology and graph theory

Given a simple graph and its complement, prove that either of them is always connected.

Are resistor-battery networks always uniquely solvable?

When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]

Proof a graph is bipartite if and only if it contains no odd cycles

Computing the expected size of the largest connected component in a "hitomezashi graph" (described in the question body)

How does TREE(3) grow to get so big? (Laymen explanation)

Best algorithm for detecting cycles in a directed graph [closed]