421 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College LondonGB63 papers
- Systemic Risk CentreGB48 papers
- University of OxfordGB20 papers
- University of WarwickGB18 papers
- King's College LondonGB16 papers
- London Mathematical LaboratoryGB12 papers
- University of Illinois Urbana-ChampaignUS12 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- Queen Mary University of LondonGB11 papers
- The Open UniversityGB11 papers
- City, University of LondonGB10 papers
- ETH ZurichCH10 papers
5 papers · 2 filters
Extremal C4-free/C5-free planar graphs
Chris Dowden
We study the topic of "extremal" planar graphs, defining to be the maximum number of edges possible in a planar graph on vertices that does…
Independent Sets, Matchings, and Occupancy Fractions
Ewan Davies, Matthew Jenssen, Will Perkins +1
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of…
Chromatic thresholds in sparse random graphs
Peter Allen, Julia Böttcher, Simon Griffiths +2
The chromatic threshold of a graph with respect to the random graph is the infimum over such that the following holds with high probability: the fam…
Triangle-free subgraphs of random graphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the str…
Partite Saturation Problems
Barnaby Roberts
We look at several saturation problems in complete balanced blow-ups of graphs. We let denote the blow-up of onto parts of size and refer to a copy of in …