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
14 papers · 2 filters
Maximizing the density of 's in graphs of bounded degree and clique number
R. Kirsch, A. J. Radcliffe
Zykov showed in 1949 that among graphs on vertices with clique number , the Turán graph maximizes not only the number of edges but also the number of copie…
Packing degenerate graphs
Peter Allen, Julia Böttcher, Jan Hladký +1
Given and , whenever is sufficiently small and sufficiently large, if is a family of -degenerate graphs of individual orders at most , maximu…
-Foldability of Words
Beth Bjorkman, Garner Cochran, Wei Gao +6
We extend results regarding a combinatorial model introduced by Black, Drellich, and Tymoczko (2017+) which generalizes the folding of the RNA molecule in biology. Consider a word…
Finding tight Hamilton cycles in random hypergraphs faster
Peter Allen, Christoph Koch, Olaf Parczyk +1
In an -uniform hypergraph on vertices a tight Hamilton cycle consists of edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…
Bounding the size of an almost-equidistant set in Euclidean space
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $…
A note on diameter-Ramsey sets
Jan Corsten, Nóra Frankl
A finite set is called if for every , there exists some and a finite set $B \subset \mathbb{R…
Supersaturation of Even Linear Cycles in Linear Hypergraphs
Tao Jiang, Liana Yepremyan
A classic result of Erdős and, independently, of Bondy and Simonovits says that the maximum number of edges in an -vertex graph not containing , the cycle of length …
Balanced supersaturation for some degenerate hypergraphs
Jan Corsten, Tuan Tran
A classical theorem of Simonovits from the 1980s asserts that every graph satisfying must contain copies…
The number of hypergraphs without linear cycles
József Balogh, Bhargav Narayanan, Jozef Skokan
The -uniform linear -cycle is the -uniform hypergraph on vertices whose edges are sets of consecutive vertices in a cyclic ordering of the vertex set…
Completing graphs to metric spaces
Andrés Aranda, David Bradley-Williams, Eng Keat Hng +5
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for part…
Improper Colourings inspired by Hadwiger's Conjecture
Jan van den Heuvel, David R. Wood
Hadwiger's Conjecture asserts that every -minor-free graph has a proper -colouring. We relax the conclusion in Hadwiger's Conjecture via improper colourings. We prove t…
Colouring exact distance graphs of chordal graphs
Daniel A. Quiroz
For a graph and positive integer , the exact distance- graph is the graph with vertex set and with an edge between vertices and if an…
Characterising inflations of monotone grid classes of permutations
Michael Albert, Aistis Atminas, Robert Brignall
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least o…
Recognizing generalized Petersen graphs in linear time
Matjaž Krnc, Robin J. Wilson
By identifying a local property which structurally classifies any edge, we show that the family of generalized Petersen graphs can be recognized in linear time.