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.

Mfano wenye matokeo · 5 choose 2

Discrete-Math · Counting

5 choose 2

5,\ 2

Hatua kwa hatua

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

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

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

Lafunua jibu
\binom{5}{2} = 10

Sasa Chagua tatizo, au aina ya barua au uchore.

Keep your own working

Akaunti la bure laongezea mambo makuu juu ya kila somo, rekodi ya yale ambayo umemaliza, matatizo yako ya kutatua katika sehemu moja, na mtunzaji unayeweza kuuliza juu ya ukurasa huu.

Jisajili Login

Ishara zinazotumiwa hapa

Vaa alama yoyote ya ufafanuzi kamili, picha, na maana ya kila herufi.

Jinsi ya Kufaulu: Paths, cycles, trees, Euler and Hamilton

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

Maswali ambayo watu huuliza

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.

Mengi zaidi katika Combinatorics & Graph Theory

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