Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
Randomized approaches to combinatorIal packing and covering problems
Kuhn, Daniela
(Principal Investigator)
Osthus, Deryk
(Co-Investigator)
Mathematics
Overview
Fingerprint
Research output
(2)
Research output
Research output per year
2017
2017
2018
2018
2
Article
Research output per year
Research output per year
2 results
Publication Year, Title
(descending)
Publication Year, Title
(ascending)
Title
Type
Search results
2018
How to determine if a random graph with a fixed degree sequence has a giant component
Joos, F.
,
Perarnau, G.
,
Rautenbach, D.
&
Reed, B.
,
Feb 2018
,
In:
Probability Theory and Related Fields.
170
,
1-2
,
p. 263-310
48 p.
Research output
:
Contribution to journal
›
Article
›
peer-review
Open Access
File
Random Graphs
100%
Giant Component
97%
Degree Sequence
82%
Graph
22%
Simple Graph
22%
4
Citations (Scopus)
272
Downloads (Pure)
2017
Clique decompositions of multipartite graphs and completion of Latin squares
Barber, B.
,
Kühn, D.
,
Lo, A.
,
Osthus, D.
&
Taylor, A.
,
Oct 2017
,
In:
Journal of Combinatorial Theory, Series A.
151
,
p. 146-201
55 p.
Research output
:
Contribution to journal
›
Article
›
peer-review
Open Access
File
Multipartite Graph
100%
Magic square
74%
Clique
63%
Completion
59%
Decompose
41%
12
Citations (Scopus)
141
Downloads (Pure)