Of Notes

Path counts in the Tutorial 1 graphs

1 min read · revised 19 October 2026 · ·

Table of Contents

Problem

Use the adjacency matrices from exercise 2 to prove that the left graph of exercise 1 has exactly four paths of length three and no paths of length 4 or larger. Argue why the middle and right graphs contain paths of every length .

Solution

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card