Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Assuming there is a undirected random graph $G=(V,E)$, $|V|=N$ and its adjacent matirx is $A$.

What is the sufficient and necessary conditions of A for that there is a giant component of graph $G$?

We means that there is a large connected component with more than $2N/3$ nodes by a giant component.

share|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.