Practice problems with hints and solutions · ProofAnvil Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available. Progress labels
IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due
Problem results
ProblemCourse & topicStatus
CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—CountingDiscrete Mathematics Problem Solving
Combinatorics and inclusion-exclusionDiscrete Mathematics · Calculation
—Showing 24 of 43 matching problems.
Prove that a tree T on 2m vertices has a perfect matching if and only if for every vertex v, the forest T-v has…
Let G be 3-regular and bridgeless (you may use Petersen’s theorem that every such graph has a perfect matching).
[Honors] Let G be a simple bipartite graph with bipartition (A,B) and ∣ A∣=∣ B∣=n≥ 1. A simple connected graph G has 17 vertices and 16 edges.
Let F be a forest (an acyclic simple graph) with 20 vertices and 16 edges.
Let T be a tree in which every vertex has degree 1 or degree 4.
There are six isomorphism types of trees on 6 vertices.
Prove that every tree with at least two vertices has at least two leaves.
Let G be a simple graph with n vertices, where n≥ 1. A full 3-ary tree is a rooted tree in which every internal vertex has exactly three children.
A rooted tree T has root r and remaining vertices {a, b, c, d, e, f, g, h}. A rooted binary tree is a rooted tree in which each vertex has at most two children, distinguished as a left child…
Insert the keys 45, 12, 67, 8, 23, 54, 89, 19, 30, in that order, into an initially empty binary search tree.
Use Huffman’s algorithm to construct a binary prefix code for the alphabet {A, B, C, D, E} with frequencies… The inorder traversal of a rooted binary tree T visits the vertices in the order B, A, D, C, E, F, G.
Consider the fully parenthesized arithmetic expression ((2 + 3) * (4 - 1)) + ((8 / 2) + 5).
Let T be the rooted tree with vertex set {1, 2, …, 12}, root 1, and edge set {1−2, 1−3, 1−4, 2−5… (Honors) Prove that a rooted binary tree, with vertices labeled by a fixed set, is uniquely determined by the pair…
Let Cn denote the nth Catalan number Cn=n+11(n2n). Cayley’s formula states that the number of distinct spanning trees of the labelled complete graph Kn is nn−2. Let G be the simple graph with vertex set {A, B, C, D, E} and edge set {AB, BC, CD, DA, AC, BE, DE}. Let G be the weighted graph with vertices {A, B, C, D, E, F} and weighted edges AB:4, AC:2, BC:5, BD:10,… Let H be the weighted graph with vertices {s, t, u, v, w} and weighted edges st:6, su:1, sv:5, tu:2… (Honors) Let G be a connected weighted graph in which all edge weights are pairwise distinct.