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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
SIAMDM
1998
favorite
Email
discuss
report
165
views
more
SIAMDM 1998
»
The Number of Independent Sets in a Grid Graph
13 years 11 months ago
Download
www.ces.clemson.edu
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier results of Weber [2]
Neil J. Calkin, Herbert S. Wilf
Real-time Traffic
Double Limit
|
Grid
|
Independence Number
|
SIAMDM 1998
|
claim paper
Post Info
More Details (n/a)
Added
23 Dec 2010
Updated
23 Dec 2010
Type
Journal
Year
1998
Where
SIAMDM
Authors
Neil J. Calkin, Herbert S. Wilf
Comments
(0)
Researcher Info
SIAMDM 1998 Study Group
Computer Vision