Abstract
For every ϵ > 0 and every positive integers Δ and r, there exists C = C ( ϵ , Δ , r ) such that the Ramsey number, R ( H , H ) of any r-uniform hypergraph H with maximum degree at most Δ is at most C | V ( H ) | 1 + ϵ .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
