7.7k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR1.3k papers
- Vrije Universiteit BrusselBE1.1k papers
- Université Libre de BruxellesBE1k papers
- University of Maryland, College ParkUS1k papers
- RWTH Aachen UniversityDE957 papers
- The Ohio State UniversityUS957 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR951 papers
- University of Wisconsin–MadisonUS935 papers
- University of CanterburyNZ926 papers
- Massachusetts Institute of TechnologyUS922 papers
- California Institute of TechnologyUS909 papers
- University of KansasUS899 papers
10 papers · 2 filters
New Computational Upper Bounds for Ramsey Numbers R(3,k)
Jan Goedgebeur, Stanisław P. Radziszowski
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87,…
Constant rank-distance sets of hermitian matrices and partial spreads in hermitian polar spaces
Rod Gow, Michel Lavrauw, John Sheekey +1
In this paper we investigate partial spreads of through the related notion of partial spread sets of hermitian matrices, and the more general notion of constant rank-…
The Generation of Fullerenes
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator fo…
Generation and Properties of Snarks
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund +1
For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is sufficient to prove them for \emph{snarks}, the class of nontrivial 3-regular gra…
House of Graphs: a database of interesting graphs
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur +1
In this note we present House of Graphs (http://hog.grinvin.org) which is a new database of graphs. The key principle is to have a searchable database and offer -- next to complete…
Sets of generators blocking all generators in finite classical polar spaces
Jan De Beule, Anja Hallez, Klaus Metsch +1
We introduce generator blocking sets of finite classical polar spaces. These sets are a generalisation of maximal partial spreads. We prove a characterization of these minimal sets…
On sets of vectors of a finite vector space in which every subset of basis size is a basis II
Simeon Ball, Jan De Beule
This article contains a proof of the MDS conjecture for . That is, that if is a set of vectors of in which every subset of of size is a b…
An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q)
Michel Lavrauw, Leo Storme, Peter Sziklai +1
Let Ck(n, q) be the p-ary linear code defined by the incidence matrix of points and k-spaces in PG(n, q), q = p^h, p prime, h >= 1. In this pa- per, we show that there are no codew…
On codewords in the dual code of classical generalised quadrangles and classical polar spaces
Valentina Pepe, Leo Storme, Geertrui Van de Voorde
In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we charac…
On large maximal partial ovoids of the parabolic quadric $\q(4,q)$
Jan De Beule
We use the representation for $\q(4,q)$ to show that maximal partial ovoids of $\q(4,q)$ of size , , odd prime, , do not exist. Although this was…