Exercises
Multiple Choice
Articles
Open Problems
Login
15 items
Tagged:
induction
x
bipartite graph
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Undergraduate
By
diego
on June 27, 2012 | Updated Dec. 6, 2017
Unmatchable edges of bipartite graphs
Prove that the following algorithm finds the unmatchable edges of a bipartite graph \(G\) (edges that aren't in any perfect matching): find a perfect matching in \(G\), orient the unmatched edges from…
Mathematics
Graph Theory
bipartite graph
matching
0
Undergraduate
By
123forman
on May 8, 2014 | Updated Dec. 6, 2017
Democratic distribution of wealth
A crew of 100 pirates have captured 100 laptops. The pirates are ranked 1 through 100, with pirate 100 being the pirate king. Captured booty is distributed as follows. The pirate king proposes a dis…
Mathematics
Discrete Mathematics
Game Theory
induction
0
Graduate
By
Shiva Kintali
on Sept. 11, 2012 | Updated Dec. 6, 2017
Vertex cover in bipartite graphs
The Vertex Cover of a graph \(G(V,E)\) is a set of vertices \(S \subseteq V\) such that each edge of the graph is incident to at least one vertex of the set \(S\). Minimum cost vertex cover : Given a…
Mathematics
Optimization
Graph Theory
Linear Programming
bipartite graph
vertex cover
0
Undergraduate
By
Shiva Kintali
on July 30, 2012 | Updated Dec. 6, 2017
k-regular bipartite graphs are 2-connected
Prove that every connected \(k\)-regular bipartite graph on at least three vertices is 2-connected.
Mathematics
Graph Theory
bipartite graph
connectivity
0
High School
By
Shiva Kintali
on June 27, 2013 | Updated Jan. 4, 2018
Basics of Induction
Prove the following using induction: \(\sum_{i=1}^{n}{i} = \frac{n(n+1)}{2}\). \(\sum_{i=1}^{n}{i}^2 = \frac{n(n+1)(2n+1}{6}\). \(\sum_{i=1}^{n}{i}^3 = {(\frac{n(n+1)}{2})}^2\). …
Mathematics
Discrete Mathematics
induction
summation
1
Undergraduate
By
Shiva Kintali
on Sept. 27, 2013 | Updated Jan. 4, 2018
Fibonacci numbers and Induction
The Fibonacci numbers, \(F_0, F_1, F_2, \dots\) , are defined recursively by the equations \(F_0 = 0\), \(F_1 = 1\), and \(F_n = F_{n-1} + F_{n-2},\) for \(n > 1\). Prove that …
Mathematics
Discrete Mathematics
fibonacci
induction
tiling
0
Graduate
By
Shiva Kintali
on Sept. 23, 2012 | Updated Dec. 6, 2017
Characterizing factor-critical graphs
A graph \(G\) is said to be factor-critical if \(G-v\) has perfect matching for every \(v \in V(G)\). Prove that no bipartite is factor-critical. Show that \(G\) is factor-critical if and only if …
Mathematics
Graph Theory
bipartite graph
matching
0
Undergraduate
By
Shiva Kintali
on May 19, 2013 | Updated Dec. 6, 2017
Regular bipartite super-graph
Let \(G\) be a simple bipartite graph where each side of the bi-partition has size \(n\). The maximum degree of \(G\) is \(\Delta \le n/10\). Show that there exists a \(2 \Delta\)-regular simple bip…
Computer Science
Mathematics
Algorithms
Graph Theory
bipartite graph
graph algorithms
0
High School
By
Shiva Kintali
on Sept. 30, 2013 | Updated Jan. 4, 2018
Using Binomial Theorem
Prove the following using binomial theorem and/or mathematical induction Let \(a\), \(b\) and \(n\) be natural numbers, prove that \(\frac{(a+\sqrt{b})^n + (a-\sqrt{b})^n}{2}\) is also a natural …
Mathematics
Discrete Mathematics
binomial theorem
induction
0
Undergraduate
By
Shiva Kintali
on June 16, 2012 | Updated Dec. 6, 2017
L shaped tiling
Consider a \(2^n × 2^n\) board with one (arbitrarily chosen) square removed, as in the following figure for \(n = 3\). Prove that any such board can be tiled (without gaps or overlaps) by \(L\)-shaped…
Puzzles
Puzzles
induction
tiling
1
2
next page »
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
vertex cover
linear time algorithms
sums
counting
amortized analysis
graph reconstruction
eulers formula
girth
petersen graph
planar graphs
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×