Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
25
click to vote
JCT
2008
70
views
more
JCT 2008
»
The number of possibilities for random dating
13 years 8 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
claim paper
Read More »