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
34
click to vote
COMBINATORICS
2002
favorite
Email
discuss
report
111
views
more
COMBINATORICS 2002
»
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
13 years 10 months ago
Download
www.ime.usp.br
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induces an oriented cycle of length .
Jair Donadelli, Yoshiharu Kohayakawa
Real-time Traffic
Arbitrarily Large
|
COMBINATORICS 2002
|
Sparse Oriented Graph
|
claim paper
Post Info
More Details (n/a)
Added
17 Dec 2010
Updated
17 Dec 2010
Type
Journal
Year
2002
Where
COMBINATORICS
Authors
Jair Donadelli, Yoshiharu Kohayakawa
Comments
(0)
Researcher Info
COMBINATORICS 2006 Study Group
Computer Vision