maths.free › Combinatorics & Graph Theory › Paths, cycles, trees, Euler and Hamilton

Paths, cycles, trees, Euler and Hamilton

Connectivity, spanning trees, Euler circuits and the bridges of Königsberg.

A tree is a connected graph with no cycles: n vertices, n − 1 edges. Euler proved a graph has a circuit using every edge once exactly when every degree is even. The Königsberg bridges failed. Picture it: the seven bridges; four land masses with odd degree. Think it: Euler's condition is local (degrees) yet decides a global question, the first theorem of topology.

Nhazi ahụ ejirila · 5 choose 2

Discrete-Math · Counting

5 choose 2

5,\ 2

Nzọụkwụ site n'ụdị

  1. \binom{5}{2} = \frac{5!}{2!\,(5-2)!}

    Unordered selections: n! / (k! (n−k)!).

  2. = \frac{120}{2 \times 6} = 10

Gosi nzaghachi
\binom{5}{2} = 10

Ugbu a ị Họrọ nsogbu, mọọbụ tinye mọọbụ depụta gị. Nzọụkwụ ọbụla, inyogo, azịza ahụ echekwara ruo mgbe ịjụla.

Kwụsị ọrụ gị

Akwụkwọ ndebanye n'efu na-egbakwunye ntọala n'ụdị ọmụmụ ihe ọbụla, ndepụta nke ihe ị ga-eme, nsogbu ị ga-ewepụ n'otu ebe, na onye nkụzi ị ga-ajụ banyere ihuakwụkwọ a. Akwụkwọ ndepụta ihe bụ nke ọbụla mepere maka onye ọbụla, ọbụla ma ọ bụ na ọ bụghị.

Akaụntụ Nbanye

Aịkọn ndị ahụ ejirila ebe a

Tinye ọbụla simbụl maka nkọwa zuru ezu, inyogo, na ihe ọbụla ọbụla na-egosi.

Olee otú: Paths, cycles, trees, Euler and Hamilton

  1. Unordered selections: n! / (k! (n−k)!).

Ajụjụ ndị mmadụ jụrụ

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Oge Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesColouring and planar graphs