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
16
click to vote
DM
2010
favorite
Email
discuss
report
75
views
more
DM 2010
»
On the topological lower bound for the multichromatic number
13 years 7 months ago
Download
www.renyi.hu
Péter Csorba, József Osztényi
Real-time Traffic
DM 2008
|
DM 2010
|
claim paper
Related Content
»
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II A Simple E...
»
On the Number of Birch Partitions
»
On the maximum number of edges in quasiplanar graphs
»
Linear Decision Trees Volume Estimates and Topological Bounds
»
Optimal OnLine Colorings for Minimizing the Number of ADMs in Optical Networks
»
From a static impossibility to an adaptive lower bound the complexity of early deciding se...
»
Parallel Randomized Load Balancing A Lower Bound for a More General Model
»
Optimal topological simplification of discrete functions on surfaces
»
Traffic grooming in path star and tree networks complexity bounds and algorithms
more »
Post Info
More Details (n/a)
Added
24 Jan 2011
Updated
24 Jan 2011
Type
Journal
Year
2010
Where
DM
Authors
Péter Csorba, József Osztényi
Comments
(0)
Researcher Info
DM 1998 Study Group
Computer Vision