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
Toughness and Vertex Degrees
D. Bauer, H. J. Broersma, J. van den Heuvel +2
We study theorems giving sufficient conditions on the vertex degrees of a graph to guarantee is -tough. We first give a best monotone theorem when , but then show…
Families of parameters for SRNT graphs
Norman Biggs
The feasibility conditions obtained in a previous report are refined, and used to determine several infinite families of feasible parameters for strongly regular graphs with no tri…
Shadows of ordered graphs
Béla Bollobás, Graham Brightwell, Robert Morris
Isoperimetric inequalities have been studied since antiquity, and in recent decades they have been studied extensively on discrete objects, such as the hypercube. An important spec…
On the representability of totally unimodular matrices on bidirected graphs
L. Pitsoulis, K. Papalamprou, G. Appa +1
Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called -…
Order-invariant measures on fixed causal sets
Graham Brightwell, Malwina Luczak
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type…