18th British Combinatorial Conference
University of Sussex, Brighton,
2-6 July, 2001
Contributed talks:
- T. Adachi,
Failure polynomials of quorum systems generated by Hamming
codes
- G. Agnarsson,
On chordal graphs and their chromatic polynomials
- A. Aguglia,
Intransitive collineation groups of ovals fixing a triangle
- H. Aït Haddadene,
On the quasi-locally paw-free graphs
- S. Akbari,
Uniquely total colourable graphs
- P. P. Alejandro,
Diagonal groups preserving a unique finest group-invariant
association scheme
- R. A. Bailey,
Balanced colourings of strongly regular graphs
- B. Bajnok,
Generalized sum-free sets in Z_n and spherical designs
- S. Ball,
Maximal arcs in small Desarguesian planes
- D. Bedford,
Defining sets for latin squares from a given main class
- F. K. Bell,
On the dimension of graph eigenspaces
- H. A.-D. Bencherif,
Linear arboricity: a survey
- W. Bessouf,
Theorems of Menger type for bidirected and signed graphs
- H. Bielak,
Local Ramsey numbers for some graphs
- A. Blinco,
Decompositions into cycles with a chord
- A. Blokhuis,
Blocking sets in PG(2,p) for small p
- A. Bonato,
Generalized pigeonhole properties of graphs and digraphs
- A. Bonisoli,
How to kill one projective plane of order 15
- G. Bonoli,
On amply regular (0,\alpha)-geometries
- R. F. Booth,
Circuits in Lagrangian matroids
- M. R. Brown,
A geometrical construction of the oval(s) associated with an
\alpha-flock
- J. M. Brunat,
Chromatic automorphisms of consecutive digraphs
- N. J. Calkin,
Biased coin tossing and moment inequalities
- K. Cameron,
Induced matchings and strong edge-colourings in weakly chordal
graphs
- P. J. Cameron,
Multi-letter Youden rectangles from quadratic forms
- A. R. Camina,
Finite projective planes with a line-transitive collineation
group
- P. Cara,
Residually minimal incidence geometries
- I. Cardinali,
On the sporadic semifield flock
- D. Cariolaro,
Regular graphs of even order and high degree are 1-factorizable
- S. Cauchie,
Full embeddings of (\alpha,\beta)-geometries in projective
spaces
- P. V. Ceccherini,
Hypercubes, weighted voting systems, games and geometry
- S. Ceroi,
The clique number of intersection graphs of convex bodies
- W. E. Cherowitzo,
On flocks of cones: herd spaces
- W. Chu,
From optical orthogonal codes to cyclic Steiner quadruple
systems
- E. J. Cockayne,
Increasing the upper irredundance number of a graph by adding
edges
- F. Cuzzolin,
Lattice modularity and linear independence
- D. Cvetkovic,
The maximal exceptional graphs with maximal degree less than
28
- P. Dankelmann,
The domatic number of regular graphs
- P. Danziger,
Class-uniformly resolvable designs
- D. P. Day,
On strong distances in digraphs I
- J. De Beule,
Partial spreads of T_2(O)
- B. De Bruyn,
Characterizations of near hexagons by means of one local space
- A. Delandtsheer,
Line-transitive, point-imprimitive linear spaces
- A. de Mier,
Locally grid graphs: classification and Tutte-uniqueness
- A. Devillers,
Ultrahomogeneous and homogeneous Steiner systems
- E. Dobson,
On isomorphisms of abelian Cayley objects of certain orders
- D. Donovan,
Uniform critical sets in Latin squares
- A. Drápal,
Hamming distances of group multiplication tables
- J. Edmonds,
Polytopes with 0-1 constraint matrices
- K. Edwards,
Edge decomposition of complete multipartite graphs
- M. N. Ellingham,
Connected (g,f)-factors
- C. Eslahchi,
Circular chromatic number of hypergraphs
- A. B. Evans,
Clique numbers of certain orthomorphism graphs: a progress
report
- G. Farr,
Planarisation for graphs of bounded degree
- B. Farzad,
(\Delta - k)-critical graphs
- S. Ferret,
On the size of complete caps in PG (3,2^h)
- M. A. Fiol,
Some algebraic characterizations of completely regular and perfect
codes
- H. Fleischner,
Connectedness of CNF formulas
- M. Giulietti,
On the completeness of certain (n;k,k-2)-sets in PG(k-1,q)
- L. Giuzzi,
A characterization of the classical unital
- A. J. Goodall,
The Tutte polynomial modulo a prime
- P. Govaerts,
Partial t-spreads and ovoids of finite classical polar spaces and
hexagons
- M. J. Grannell,
Maximum genus embeddings of Steiner triple systems
- C. Greenhill,
Permutation graphs and contiguity
- T. S. Griggs,
More on large sets of Steiner triple systems
- H. Gropp,
125 years of configurations: survey and update
- G. Gutin,
Travelling salesman should not be greedy
- R. Häggkvist,
Ear decompositions and near P_4-ditto
- P. R. Hammond,
Partitions into odd parts
- H. Harborth,
King independence on triangle boards
- L. Hellström,
How many steps does Gauss-Jordan elimination require?
- M. A. Henning,
Defending the Roman Empire: a new strategy
- A. J. W. Hilton,
The structure of graphs of high degree which are critical with
respect to the total chromatic number
- F. C. Holroyd,
Colouring cubic graphs using Steiner triple systems
- B. Jackson,
Highly connected detachments of graphs and digraphs
- M. Jerrum,
Approximating the permanent
- M. Johnson,
Amalgamations of l-edge-connected k-factorizations
- L. K. Jørgensen,
Small girth 5 graphs from relative difference sets.
- D. Jungnickel,
Two instances of the Prime Power Conjecture for projective
planes
- K. Kawarabayashi,
Any 7-chromatic graph has K_7 or K_4,4 as a minor
- A. D. Keedwell,
Construction of m-inverse quasigroups with a long inverse
cycle
- A. Khelladi,
Eulerian and Hamiltonian properties of the fibred product of
graphs
- V. Kisil,
Dissects, tokens, and enumeration
- G. Kiss,
1-factorizations of complete multigraphs and quadrics in
PG(n,q)
- M. Klin,
Automorphism groups of the circulant graphs with odd prime-power
number of vertices
- A. E. Koller,
Domination analysis of greedy heuristics for the frequency
assignment problem
- E. V. Konstantinova,
Enumeration and generation of animals
- G. Korchmáros,
Transitive ovoids of the Hermitian surface
- I. Kovács,
On the relation between the Cayley graphs Cay(G,B) and the Fourier
transformation over G
- D. Labbate,
Det-extremal regular bipartite graphs
- J. D. Lamb,
Some matrix and matroid results on equation formulation for
electical networks
- R. Laue,
Some 10^4000 isomorphism types of simple 7-designs on up to 32
points
- M. Lavrauw,
On the classification of semifield flocks
- C. Laywine,
A hierarchy of complete orthogonal structures
- A. Lev,
On graph labelling problems and regular factorizations of complete
graphs
- V. I. Levenshtein,
A universal bound for a covering in posets and its application
- E. K. Lloyd,
Recent delvings in the Redfield archives
- C. P. Love,
On the (22,4)-arcs in PG(2,7) and related codes
- P. H. Lundow,
Spin-flip probabilities for Metropolis sampling in the Ising
model
- B. M. Maenhaut,
Common multiples of complete graphs
- H. R. Maimani,
On the automorphism group of a biplane of order 18
- X. Marcote,
Every cubic cage is quasi 4-connected
- K. Markström,
Spanning subgraphs and cycle double covers
- N. Martin,
Complete bipartite factorisations mostly exist
- T. Maruta,
On the extendability of linear codes
- C. McDiarmid,
Bounds for the span in channel assignment problems
- S. McGuinness,
Contractible bonds in graphs
- B. D. McKay,
Fast generation of planar graphs
- D. Moazzami,
On the tenacity of a graph: a comparative survey
- B. Montágh,
Anti-Ramsey theorems on big double stars and on long paths
- C. M. Mynhardt,
Improved upper bound for queens domination numbers
- W. Myrvold,
Finding a maximum independent set in the 120-cell
- G. P. Nagy,
On loops of small exponent
- S. D. Noble,
Evaluating the U -polynomial for graphs of bounded tree-width
- R. J. Nowakowski,
A note on special star partitions
- M. A. Ollis,
Sectionable terraces and the (generalised) Oberwolfach problem
- P. J. Owens,
Types of edges in polyhedral graphs
- D. B. Penman,
A survey of models of random graphs
- S. Perkins,
Non-complete prefix codes that contain extended synchronizing
codewords
- L. Plachta,
Combinatorial patterns of incompressible surfaces in link
complements
- M. D. Plummer,
On equimatchable 3-polytopes
- H. Pralle,
Non-uniform hyperplanes of dual polar spaces
- D. A. Preece,
Round-dance neighbour designs from terraces
- M. Priesler,
On some multigraph decomposition problems and their computational
complexity
- S. Rajola,
Small maximal partial spreads in Steiner systems
- D. H. Rees,
Existence of OBIBDs with k = 4, with and without nesting
- Y. Roditty,
Some results in step domination of graphs
- P. Rowlinson,
Star complements and exceptional graphs
- C. G. Rutherford,
Codes over the integers modulo 4 and matroid chains
- A. Saito,
Cycles having the same modularity
- M. R. Salavatipour,
A bound on the chromatic number of the square of a planar
graph
- M. Sebille,
Homogeneous designs associated with the Mathieu groups
- J. Sheehan,
2-factors
- H. Shen,
Existence of incomplete resolvable Mendelsohn triple systems
- R. Shrock,
Chromatic and Tutte polynomials and related asymptotic limiting
functions for families of graphs
- D. H. Smith,
Frequency assignment, graph colouring and lower bounds
- A. Sonnino,
Mixed partitions and symmetric configurations
- D. Stark,
Prolific constructions of strongly regular graphs with the n-e.c.
property
- A. P. Street,
Proportionally balanced designs
- H. C. Swart,
On strong distances in digraphs II
- M. S. Tallini,
Projective planes and Hadamard designs
- K. Thas,
On finite flag-transitive projective planes
- R. Tsaur,
Convexity and fixed point properties in graphs: a study of
many-valued functions in Helly and dismantlable graphs
- K. Ushio,
Balanced bowtie designs
- A. Vainshtein,
Counting occurrences of 132 in a permutation
- J. van den Heuvel,
Labellings, orientations, and greedy algorithms
- B. N. Varma,
Super line digraphs
- T. R. Walsh,
Loop-free sequencing of Gray codes
- I. M. Wanless,
Dominating sets of permutations and transversals of Latin
squares
- B. S. Webb,
What is an infinite design?
- Z. Weiner,
Large minimal blocking sets in Desarguesian projective planes of
square order
- C. D. Wensley,
The endomorphism digraph of a reflexive digraph
- C. Whitehead,
Observability of the extended Fibonacci cubes
- J. Williams,
Bicycles and bike chains in Latin rectangles and total
colourings
- M. Wozniak,
On the number of cycle lengths in a hamiltonian graph with respect
to the maximum degree
- A. Yeo,
Decomposing k-arc-strong tournaments into strong spanning
subdigraphs
- N. Zagaglia Salvi,
Lattices related to extended Fibonacci cubes
- C.-Q. Zhang,
Nowhere-zero 4-flows, simultaneous edge-colourings, and critical
partial Latin squares
- Y. Zhao,
A new lower bound of the size of edge chromatic critical
graphs
Back to the British Combinatorial
Conferences
page.