Trees · Introduction

Lesson 2

Nikolai Chukhin · Alexander S. Kulikov

Problem. Mark all correct statements.

This problem can only be submitted at Cogniterra.

  1. A tree with \(n\) vertices contains exactly \(n-1\) edges.

  2. Any connected undirected graph with \(n\) vertices and \(n-1\) edges is a tree.

  3. An undirected graph is a tree if and only if there is exactly one path between any two vertices.

  4. Any tree with at least two vertices has at least one leaf (a vertex of degree one).