This post has been de-listed
It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.
2
[Graph Theory] Show that, for every bipartite graph graph with maximum degree k, there is a k-regular bipartite graph H that contains G as an induced subgraph
Author Summary
VinceMiguel is
in
Graph Theory
Post Body
I'm having trouble showing that, for every bipartite graph graph with maximum degree k, there is a k-regular bipartite graph H that contains G as an induced subgraph. I can come up with examples of this, but having a hard time in actually proving it.
Any help would be greatly appreciated!
Author
Account Strength
100%
Account Age
10 years
Verified Email
Yes
Verified Flair
No
Total Karma
24,261
Link Karma
3,790
Comment Karma
20,224
Profile updated: 4 days ago
Posts updated: 1 month ago
Subreddit
Post Details
Location
We try to extract some basic information from the post title. This is not
always successful or accurate, please use your best judgement and compare
these values to the post title and body for confirmation.
- Posted
- 3 years ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/learnmath/c...