Sökning: "Hamming-graf"

Hittade 1 uppsats innehållade ordet Hamming-graf.

  1. 1. What can Turán tell us about the hypercube?

    Kandidat-uppsats, Institutionen för matematik och matematisk statistik

    Författare :Emilott Lantz; [2012]
    Nyckelord :Turán problem; graph theory; Turán s theorem; hypercube; Hamming graph; layer; Turán-problem; grafteori; Turáns sats; hyperkub; Hamming-graf; lager;

    Sammanfattning : The Turán problem is a fundamental problem in extremal graph theory. It asks what the maximum number of edges a given graph G can have, not containing some forbidden graph H, and is solved using the Turán number ex(n,H), density π(H) and graph Tr(n). LÄS MER