NEWS
Find a Professional: Explore Experts Across 197 Disciplines in 221 Countries!
Just Updated: Compare Your Institution (Live Data)
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025 (Updated Today)
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
Login
Register & Pricing
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
For Students
local_fire_department
Country Reports
person
Find a Professional
Deryk Osthus
University of Birmingham - Birmingham / United Kingdom
Natural Sciences / Mathematical Sciences
AD Scientific Index ID: 4321989
Registration, Add Profile,
Premium Membership
Get Your Global Impact Certificate
Ranking &
Analysis
Job
Experiences
Education
Information
Published Books
Book Chapters
Articles
Presentations
Lessons
Projects
Co-Authors
Subject Leaders
Editorship, Referee &
Scientific Board
Patents /
Designs
Academic Grants
& Awards
Artistic
Activities
Certificate / Course
/ Trainings
Association &
Society Memberships
Contact, Office
& Social Media
person_outline
Deryk Osthus's MOST POPULAR ARTICLES
1-)
Embedding large subgraphs into dense graphs arXiv preprint arXiv:0901.3541, 2009
2-)
The minimum degree threshold for perfect graph packings Combinatorica 29 (1), 65-107, 2009
3-)
Popularity based random graph models leading to a scale-free degree sequence Discrete Mathematics 282 (1-3), 53-68, 2004
4-)
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree Journal of Combinatorial Theory, Series B 96 (6), 767-821, 2006
5-)
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degreeD Kühn, D OsthusJournal of Combinatorial Theory, Series B 96 (6), 767-821, 20061522006
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept