Networks/graph theory

  • Network Trees
    problem

    Network trees

    Age
    14 to 18
    Challenge level
    filled star empty star empty star
    Explore some of the different types of network, and prove a result about network trees.
  • Factors and multiples graphs
    problem

    Factors and multiples graphs

    Age
    16 to 18
    Challenge level
    filled star empty star empty star
    Explore creating 'factors and multiples' graphs such that no lines joining the numbers cross
  • Placeholder: several colourful numbers
    article

    Neural nets

    Find out some of the mathematics behind neural networks.
  • Simply Graphs
    problem

    Simply graphs

    Age
    16 to 18
    Challenge level
    filled star empty star empty star
    Look for the common features in these graphs. Which graphs belong together?
  • Placeholder: several colourful numbers
    problem

    Round-robin scheduling

    Age
    7 to 14
    Challenge level
    filled star empty star empty star
    Think about the mathematics of round robin scheduling.
  • The Olympic Torch Tour
    problem

    The Olympic torch tour

    Age
    14 to 16
    Challenge level
    filled star filled star empty star

    Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?

  • Torus patterns
    problem

    Torus patterns

    Age
    16 to 18
    Challenge level
    filled star filled star filled star
    How many different colours would be needed to colour these different patterns on a torus?
  • Limiting Probabilities
    problem

    Limiting probabilities

    Age
    16 to 18
    Challenge level
    filled star filled star filled star
    Given probabilities of taking paths in a graph from each node, use matrix multiplication to find the probability of going from one vertex to another in 2 stages, or 3, or 4 or even 100.
  • Maximum Flow
    problem

    Maximum flow

    Age
    16 to 18
    Challenge level
    filled star empty star empty star
    Given the graph of a supply network and the maximum capacity for flow in each section find the maximum flow across the network.