Peter Keevash

activity

20022026

most citedThe existence of designs

167 citations · 675 across the 52 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CO2016

The structure of typical eye-free graphs and a Turan-type result for two weighted colours

Peter Keevash, William Lochet

The $(a, b)$ -eye is the graph $I_{a, b} = K_{a + b} - K_{b}$ obtained by deleting the edges of a clique of size $b$ from a clique of size $a + b$ . We show that for any $a, b \geq 2$ and $p \in…

math.CO2016

Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids

Katie Clinch

A two-dimensional direction-length framework $(G, p)$ consists of a multigraph $G = (V; D, L)$ whose edge set is formed of "direction" edges $D$ and "length" edges $L$ , and a realisatio…

math.CO2016

Equiangular Lines and Spherical Codes in Euclidean Space

Igor Balla, Felix Dräxler, Peter Keevash +1

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such…

math.CO2016★ 9 cited

On the normalized Shannon capacity of a union

Peter Keevash, Eoin Long

Let $G_{1} \times G_{2}$ denote the strong product of graphs $G_{1}$ and $G_{2}$ , i.e. the graph on $V (G_{1}) \times V (G_{2})$ in which $(u_{1}, u_{2})$ and $(v_{1}, v_{2})$ are adjacent if for each $i=…

math.CO2016★ 2 cited

Bounds for spherical codes

Peter Keevash, Benny Sudakov

A set $C$ of unit vectors in $R^{d}$ is called an $L$ -spherical code if $x \cdot y \in L$ for any distinct $x, y$ in $C$ . Spherical codes have been extensively studied since…