Combinatorial Databases
This page contains pointers to databases and sources of information on the
state of the art in various specialized research areas of discrete
mathematics. These databases will be maintained by others, not under
the supervision of the Journal.
-
Neil Sloane's celebrated
On-Line
Encyclopedia of Integer Sequences is here.
- Here is a database
that shows, for each \Delta and D, the order of the largest known
graph whose maximum vertex degree is at most \Delta and whose diameter
is D.
-
The La Jolla Covering Repository gives
(v,k,t)-covering designs with v<=32, k<=16, t<=8
and less than 5000 blocks.
-
Here is an
archive
of combinatorial data maintained by Gordon Royle (graphs, geometries,
designs, groups, etc.)
-
Brendan McKay has started to make some of his
combinatorial
data available: graphs, Latin squares, tournaments, etc.
-
Here is Leonard Soicher's
Partial Spreads page, and his
SOMAs page (a SOMA is an orthogonal multi-array).
-
Bill Cherowitzo's
Hyperoval Page and
Flocks of Cones page.
-
Ted Spence's
files: classifications of various designs, strongly regular graphs,
Hadamard matrices, etc.
-
Warren Kuhfeld's page on
Orthogonal Arrays and related areas (Difference schemes, Hadamard matrices
etc.)
-
Neil Sloane's
Library of Orthogonal Arrays (including a
Table of Hadamard Matrices)
-
Small association
schemes or homogeneous coherent configurations, by
A. Hanaki and I. Miyamoto
- A database of
Strongly Regular and Distance Regular Graphs, Minimum distances of
Linear Codes over GF(q) by Andries Brouwer.
-
Bayreuth database of
t-designs and large sets
and a separate database of
interesting graphs
(molecules, fullerenes, posets, ...) together with 3-dimensional drawings.
-
Bridget Tenner's
Database of Permutation Pattern Avoidance.
-
Combinatorics Wiki:
A wiki presenting the latest concepts, results,
conjectures and references in various topics of Combinatorics.
These pages give links to information about various topics.
E-JC Home