The number of possibilities for random dating

13 years 4 months ago

Download www.dms.umontreal.ca

Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G.

Aaron Abrams, Rod Canfield, Andrew Granville

Real-time Traffic

Compact Formulas | JCT 2008 | Regular Graph |

claim paper

» The two possible values of the chromatic number of a random graph

» Generating Probability Distributions using Multivalued Stochastic Relay Circuits

» Statistical fault injection Quantified error and confidence

» Using common random numbers for indifferencezone selection

» How to Encrypt with a Malicious Random Number Generator

» Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks

» A probabilistic loadingdependent model of cascading failure and possible implications for ...

» Comparing two systems Beyond common random numbers

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCT
Authors	Aaron Abrams, Rod Canfield, Andrew Granville

Comments (0)

Sciweavers

The number of possibilities for random dating

Compact Formulas | JCT 2008 | Regular Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers