P. Östergård

activity

20072026

most citedReconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs

13 citations · 68 across the 19 of their papers we have counts for

collaborators

Showing 2013Show all

3 papers · 1 filter

math.CO2013★ 3 cited

Large Sets of $t$ -Designs over Finite Fields

Michael Braun, Axel Kohnert, Patric Östergård +1

A $t - (n, k, λ; q)$ -design is a set of $k$ -subspaces, called blocks, of an $n$ -dimensional vector space $V$ over the finite field with $q$ elements such that each $t$ -subspace i…

math.CO2013★ 12 cited

Existence of $q$ -Analogs of Steiner Systems

Michael Braun, Tuvi Etzion, Patric Ostergard +2

Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$ -analog of a Steiner system (briefly, a $q$ -Steiner system), denoted $S_{q} [t, k, n]$ , is a set $S$ o…

math.CO2013★ 2 cited

Planar Hypohamiltonian Graphs on 40 Vertices

Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård +2

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had…

Large Sets of t-Designs over Finite Fields

Existence of q-Analogs of Steiner Systems

Planar Hypohamiltonian Graphs on 40 Vertices

Large Sets of $t$ -Designs over Finite Fields

Existence of $q$ -Analogs of Steiner Systems