fkenter
|
Registered User
|
|
|
Apr 13 |
accepted | Is there a proper way to define a threshold vertex density for a random graph s.t. the graph is fully connected? |
|
Apr 12 |
awarded | ● Critic |
|
Apr 12 |
comment |
The average number of people that can sit on a bench of a given length. This site is not meant for homework help or casual questions. It is intended for research mathematics. The answer to your question lies, simply, with linearity of expectation. |
|
Apr 12 |
comment |
Distribution of Induced Subgraphs of Extremal Ramsey Graphs Since a random coloring yields a decent construction for constructing Ramsey graphs (at least up to roughly at least $R(k,k)/4$ vertices),one might expect the distribution of colors to be "random" even for larger extremal examples. If this is the case, $\tau$ follows a binomial distribution; which for large enough $k$ (appropriately normalized) would limit towards a normal distribution in probability. |
|
Apr 12 |
answered | Is there a proper way to define a threshold vertex density for a random graph s.t. the graph is fully connected? |
|
Apr 12 |
comment |
“Box Nodes” in Directed Graphs with Paired IO Symmetry I will be honest, I do not understand your question. In particular, the meaning of "box", "input", "output", and "pair" are not clear. Perhaps you should explain your examples in more detail. |
|
Apr 11 |
asked | Distribution of Induced Subgraphs of Extremal Ramsey Graphs |
