# Thread: Discrete Math Graph Help

1. ## Discrete Math Graph Help

Having a hard time understanding this problem can anyone give me a hand with it?

Random graphs are a fascinating subject of applied and theoretical research. These can be generated with a fixed vertex set V and edges added to the edge set E based on some probability model, such as a coin flip. Speculate on how many connected components a random graph might have if the likelihood of an edge (v1,v2) being in the set E is 50%. Do you think the number of components would depend on the size of the vertex set V? Explain why or why not.

2. ## Re: Discrete Math Graph Help

Californiarepoman, I, personally, can't answer your question, but found this video on You TUbe that pertains to your specific question. It is a lecture that covers random graphs and the probablistic method. There might be something in that video that may help you. You have to listen carefully, though, since his English isn't the best. I hope this helps.

Here's the link: Mod-06 Lec-35 Random graphs and probabilistic method: Preliminaries - YouTube

Sorry, that's the best I can do.