Let πΊ be an undirected graph, which is a path on 8 vertices. The number of matchings
in πΊ is ______. (answer in integer)
A path graph \(P_8\) has 8 vertices and 7 edges, labeled \(v_1 - v_2 - v_3 - \dots - v_8\). A matching is a set of edges in which no two edges share a common vertex. We must count all possible matchings, including the empty matching.
Step 1: Let \(M(n)\) denote the number of matchings in a path on \(n\) vertices. Focus on the last vertex \(v_n\) and the edge \((v_{n-1}, v_n)\).
Case (a): The edge \((v_{n-1}, v_n)\) is not used in the matching. Then the remaining choices form any matching of the path on the first \(n-1\) vertices, giving \(M(n-1)\) matchings.
Case (b): The edge \((v_{n-1}, v_n)\) is used. Then both \(v_{n-1}\) and \(v_n\) are already covered, so the remaining choices form any matching of the path on the first \(n-2\) vertices, giving \(M(n-2)\) matchings.
Since these two cases are disjoint and exhaustive, we get the recurrence:
\[ M(n) = M(n-1) + M(n-2) \]
Step 2: Set the base cases. For \(n = 1\) (a single vertex, no edges), the only matching is the empty one, so \(M(1) = 1\). For \(n = 2\) (a single edge), the matchings are the empty matching and the matching using that one edge, so \(M(2) = 2\).
Step 3: Apply the recurrence up to \(n = 8\):
\[ M(3) = M(2) + M(1) = 2 + 1 = 3 \]
\[ M(4) = M(3) + M(2) = 3 + 2 = 5 \]
\[ M(5) = M(4) + M(3) = 5 + 3 = 8 \]
\[ M(6) = M(5) + M(4) = 8 + 5 = 13 \]
\[ M(7) = M(6) + M(5) = 13 + 8 = 21 \]
\[ M(8) = M(7) + M(6) = 21 + 13 = 34 \]
Step 4: This sequence \(1, 2, 3, 5, 8, 13, 21, 34\) is exactly the Fibonacci pattern shifted by one index. The number of matchings in the path on 8 vertices is therefore 34.
The final answer is: \[\boxed{34}\]
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative

Consider a complete graph πΎπ with π vertices (π> 4). Note that multiple spanning
trees can be constructed over πΎπ. Each of these spanning trees is represented as a
set of edges. The Jaccard coefficient between any two sets is defined as the ratio of
the size of the intersection of the two sets to the size of the union of the two sets.
Which one of the following options gives the lowest possible value for the Jaccard
coefficient between any two spanning trees of πΎπ ?

An undirected, unweighted, simple graph πΊ(π, πΈ) is said to be 2-colorable if there
exists a function π: πβ{0, 1} such that for every (π’, π£) βπΈ, π(π’) β π(π£).
Which of the following statements about 2-colorable graphs is/are true?