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.
Esempio svolto · 5 choose 2
Passo dopo passo
- \binom{5}{2} = \frac{5!}{2!\,(5-2)!}
Unordered selections: n! / (k! (n−k)!).
- = \frac{120}{2 \times 6} = 10
Rivela la risposta
Ora tu Scegli un problema, o digitare o disegnare il proprio. Ogni passo, un'immagine, la risposta nascosta fino a quando non si chiede.
Simboli utilizzati qui
Toccare qualsiasi simbolo per la definizione completa, un'immagine, e che cosa ogni lettera in esso significa.
Come: Paths, cycles, trees, Euler and Hamilton
- Unordered selections: n! / (k! (n−k)!).
Domande che la gente chiede
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.
Altro in Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesColouring and planar graphs