Discrete Math Quiz
15 questions · no time limit
0:00
GRAPH THEORY
Question 1 of 15
No time limit
Current
Answered
Flagged
Not seen
In a bipartite graph G=(X∪Y,E)G = (X \cup Y, E), let S⊆XS \subseteq X with ∣S∣=4|S| = 4. If ∣N(S)∣=3|N(S)| = 3, where N(S)N(S) denotes the neighborhood of SS in YY, and GG has a matching that saturates all vertices in X∖SX \setminus S, what is the maximum possible size of a matching in GG?
YOUR PROGRESS
15
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end