22nd British Combinatorial Conference
University of St. Andrews, 6-10 July, 2009
Contributed talks:
- Ghodratollah Aalipour,
On the D-equivalence class of some families of graphs
- Marien Abreu,
Deletions, Extensions, and Reductions of Elliptic Semiplanes
- Saieed Akbari,
On the Energy of Graphs and Multigraphs
- Tim Alderson,
Spreads, arcs, and multiple wavelength codes
- Kashif Ali,
On the Ramsey numbers for linear forest versus cocktail party graphs
- Peter Allen,
On a density analogue of the Hajnal-Szemerédi theorem
- Kiyoshi Ando,
Some structural properties of a minimally contraction-critically 5-connected graph
- Lina Andrén,
Avoiding arrays with constraints that are evenly spread
- Masoud Ariannejad,
Notes on the Support of t-Designs
- S. Arumugam,
Maximal Independent Sets in Minimum Colorings
- David Auger,
Identifying Codes in Trees and Planar Graphs
- Robert Bailey,
Metric dimension of distance-regular graphs
- R. A. Bailey,
Phase transition in block designs
- Barry A. Balof,
Constructing Isospectral Non-Isomorphic Digraphs from Hypergraphs
- Sheng Bau,
A weak well-founded order in families of quadrangulations of the sphere
- Faqir M Bhatti,
Partially Ordered Sets for Bose and Fermi Walks on Planar Graphs
- Simon R Blackburn,
Distinct difference configurations
- Vladimir Blinovsky,
Proof of one correlation inequality
- Robert Brignall,
Infinite Antichains and Partial Well-Order in Permutation Classes
- Thomas Britz,
On linear codes and matroids: an overview and update
- Josep M. Brunat,
Symmetries in Steinhaus triangles and in Pascal generalized triangles
- A P Burger,
A graph-theoretic proof for the non-existence of self-orthogonal Latin squares of order six
- Andrea Burgess,
Decomposition of 3K_m into cycles of odd length
- Jose Caceres,
Metric dimension for infinite graphs
- Marc Cámara,
Two approaches (algebraic and combinatorial) to pseudo-distance-regularity around a set
- Eduardo Canale,
Avoiding words
- David Cariolaro,
The complexity of excessive factorizations
- A. Carmona,
A full version of Foster's Formulae
- Carl Johan Casselgren,
Coloring complete multipartite graphs from random lists of size 2
- Nicholas J. Cavenagh,
Multi-latin squares
- Manuel Ceballos,
Combinatorial structures and families of Lie algebras
- Hsun-Wen Chang,
Joint Structural Importance in consecutive-k-out-of-n systems
- Nam-Po Chiang,
A Note on IC-colorings of Graphs
- Robin Christian,
Duality of B-matroids, infinite graphs and graph-like spaces
- Oliver Cooley,
The Loebl-Komlós-Sós Conjecture for large, dense graphs
- Péter Csikvári,
Graph transformations in algebraic graph theory
- Dragoš Cvetkovič,
Further results on the signless Laplacian eigenvalues
- Cristina Dalfó,
On k-Walk-Regular Graphs
- Peter Dankelmann,
Average Distance and Connectivity
- Peter Danziger,
On bipartite 2-factorsations of K_n-I and the Oberwolfach problem
- Jan De Beule,
Maximal partial ovoids of the generalized quadrangle Q(4,q)
- Bart De Bruyn,
Hyperplanes of DW(5,K) with K a perfect field of characteristic 2
- Frank De Clerck,
Characterizing projections of quadrics in finite projective spaces of even characteristic
- Eva Ferrara Dentice,
Embeddings of Affine Grassmann Spaces
- Ales Drapal,
Spherical latin bitrades and dissections of equilateral triangles
- Judith Egan,
Transversals and partitions of latin squares
- Yoshimi Egawa,
4-Factors in 2-Connected Star-Free Graphs
- Birk Eisermann,
Boundedness and Representation of Tolerance Graphs
- Mark Ellingham,
Symmetries of (3,6)-fullerenes
- A.M. Encinas,
The inverse problem on finite networks
- Giovanni Falcone,
Additive designs
- David Ferguson,
Three colour Ramsey numbers for cycles
- Sanaz Zare Firoozabadi,
Multicolored Subgraphs of a Complete Graph Related to Harmonious and Semi-Harmonious Groups
- Jan Foniok,
Adjoint functors on digraphs
- Tony Forbes,
Six-sparse Steiner triple systems
- Nikolaos Fountoulakis,
Broadcasting problems on networks
- Shinya Fujita,
Gallai-ramsey numbers for cycles
- András Gács,
Permutations, hyperplanes and polynomials over finite fields
- Silvia Gago,
On Golden Spectral Graphs
- Pedro García-Vázquez,
On the super-lambda_k restricted connectivity of graphs
- Nicholas Georgiou,
The best-choice problem for partially ordered sets
- Maryam Ghanbari,
A relation between the dynamic coloring of graphs and the coloring of hypergraphs
- Shamik Ghosh,
Undirected power graphs of semigroups
- Neil Gillespie,
On Neighbour Transitive Codes
- Leslie Ann Goldberg,
Inapproximability of the Tutte polynomial of a planar graph
- Diego González-Moreno,
A lower bound on the vertex connectivity of {r,r+1;g)-cages
- Mike Grannell,
Rigid Steiner 5-designs
- Mariusz Grech,
Graphical complexity of one-generated permutation groups
- Terry Griggs,
Homogeneous toroidal Latin bitrades
- Mucuy-kak Guevara,
(k,l)-kernel and partial line in digraphs
- Roland Häggkvist,
Lollipop Andrew strikes again
- Rhiannon Hall,
Fan-like 4-separating structures in internally 4-connected binary matroids
- Anja Hallez,
Sets of generators in finite classical polar spaces blocking all generators
- Tamás Héger,
On small (k,6)-graphs
- Michael A. Henning,
On a Conjecture of Murty and Simon on Diameter Two Critical Graphs
- Timothy J. Hetherington,
Simultaneous list-colourings
- A. J. W. Hilton,
Embedding symmetric partial latin squares
- James Hirschfeld,
Cubic curves over a finite field
- Arthur Hoffmann-Ostenhof,
Mosaics, even triangulations and quadrangulations of the sphere
- Fred Holroyd,
Overlap colourings and homomorphisms of graphs
- I-Chiau Huang,
Inversions in Combinatorics
- Alexander Ivanov,
Majorana Theory
- Mark Jerrum,
A complexity dichotomy for hypergraph partition functions
- Lidia I. Jiménez,
A note on k-trees Cohen-Macaulay graphs
- Sian K. Jones,
Properties, Isomorphisms and Enumeration of Quasi-Magic Sudoku
- Leif Jørgensen,
Directed quotient graphs of bipartite graphs
- Konstanty Junosza-Szaniawski,
Counting maximal independent sets in graphs with maximum degree three
- František Kardoš,
Long Cycles in Fullerene Graphs
- Adam Kay,
Structures of Interscopal Projection
- Koko Kayibi,
Generalised T-tetrominoes and the Tutte polynomial
- A. D. Keedwell,
Quasigroup laws which imply that the quasigroup is a loop or group
- Yulia Kempner,
Poly-dimension of antimatroids
- Andrzej Kisielewicz,
Totally Symmetric Colored Graphs
- Martin Kochol,
Counterexample to the conjecture of Grunbaum
- Elena Konstantinova,
On chromatic numbers of some Cayley graphs
- Nicholas Korpelainen,
Bipartite Induced Subgraphs and Well-Quasi-Ordering
- Malgorzata Kuchta,
Embeddings of a chain into a tree
- Domenico Labbate,
Existence and costructions of pseudo and strongly pseudo 2-factor isomorphic graphs
- Vadim E. Levit,
The Value of the Independence Polynomial at -1
- Nicolas Lichiardopol,
Proof of a conjecture of Favaron and Henning on total domination in claw-free cubic graphs. Improvement of the proposed bound
- Chen-Ying Lin,
Acyclic orientations on complete k-partite graphs
- Allan Lo,
Cliques in graphs with bounded minimum degree
- Susana - C. López,
On vosperian and superconnected vertex-transitive digraphs
- Arun Mani,
On Matroids and Partial Sums of Binomial Coefficients
- David Manlove,
Keeping Partners Together: Algorithmic Results for the Hospitals/Residents Problem with Couples
- Xavier Marcote,
Some properties of (r,r+1g)-cages
- Jeanette C. McLeod,
Asymptotic enumeration of symmetric integer matrices with equal row and column sums
- Dirk Meierling,
Extending directed cycles of in-tournaments
- Francesca Merola,
Linear Numeration Systems
- Alícia Miralles,
Vertex Labeling and Routing in Self-similar Outerplanar Unclustered Graphs Modeling Complex Networks
- Margarida Mitjana,
On the spectra of sequence graphs
- Iain Moffatt,
Duality, medial graphs and polynomials of embedded graphs
- Balázs Montágh,
New results in extremal graph theory using Hall planes
- Luis Pedro Montejano,
Superconnectivity of graphs with odd girth g and even girth h
- J Moori,
Some irreducible codes invariant under the Janko group, J_1 or J_2
- Kerri Morgan,
Galois groups of chromatic polynomials
- Lucia Moura,
Some problems involving covering arrays and graphs
- Raiji Mukae,
K_6-Minors in triangulations on surfaces
- Simon Mukwembi,
Domination, Radius, and Minimum Degree
- Richard Mycroft,
Hamilton l-cycles in k-graphs
- Kieka Mynhardt,
Domination and broadcasts in trees
- Zoltán Lóránt Nagy,
A multi-partite version of the Turan problem, and the critical edge density
- Atsuhiro Nakamoto,
N-Flips in even triangulations and Dehn twists on the torus
- Mike Newman,
On edge-labellings that induce vertex colourings
- Mohammad Javad Nikmehr,
The Annihilating Ideal Graph of a Commutative Ring
- Steven Noble,
k-L(2,1)-Labelling of Planar Graphs is NP-Complete for k ≥ 4
- Alexander O'Neill,
Block designs, Cayley graphs and Markov Chains
- Lars-Daniel Öhman,
Extending partial Latin cubes
- Mika Olsen,
Kernel by monochromatic paths in a class of digraphs with covering number 2
- Deryk Osthus,
Hamilton decompositions of regular tournaments
- Kenta Ozeki,
Spanning trees on surfaces
- Daniel Panario,
Division of polynomials over finite fields and orthogonal arrays
- Konstantinos Papalamprou,
Structural and decomposition results for the class of signed-graphic matroids
- Balazs Patkos,
On randomly generated non-trivially intersecting hypergraphs
- Derek Patterson,
Generalising Fisher's Inequality
- David Penman,
Some colouring problems for pseudo-random graphs
- Linzy A. Phillips,
Encoding Information in a Sudoku Grid
- David Pike,
Embedding and Colouring Odd Cycle Systems
- Shariefuddin Pirzada,
On scores in multipartite hypertournaments
- Michael D. Plummer,
On traversing specified vertices in graphs embedded with large representativity
- Anush Poghosyan,
Discrepancy and Signed Domination in Graphs and Hypergraphs
- Donald A. Preece,
Daisy chains with four generators
- Michal Przykucki,
Optimal stopping in a search for a vertex with full degree in a random graph
- Maria Luz Puertas,
Strong product of graphs: geodetic and hull numbers and boundary-type sets
- Amarpreet Rattan,
Lattice paths below a cyclically shifting boundary
- Peter Rowlinson,
A spectral upper bound for the order of an induced k-regular subgraph
- Aidan Roy,
Minimal Euclidean representations of graphs
- Carrie Rutherford,
Preserving images of functions on subset families
- Julián Salas,
Sufficient conditions for lambda-optimality in graphs with girth pair (g,h)
- Ali Sanayei,
Analyzing and Controlling of The Duffing Oscillator Based on A.S. Method
- Jose Plinio O. Santos,
Bijective proofs using two-line matrix representations for partitions
- Amir Sapir,
Which Multi-Peg Tower of Hanoi Problems are Exponential?
- Alexader Sapozhenko,
Cameron-Erdős modulo a prime
- Uwe Schauz,
Mr. Paint and Mrs. Correct
- John Schmitt,
Graph pebbling in sparse graphs
- Hao Shen,
Existence of Resolvable Designs with subdesigns
- Hidehiro Shinohara,
Cayley partitionable graphs arising from cyclic groups with even order and dihedral groups
- Johannes Siemons,
Error Graphs and the Reconstruction of Elements in Groups
- Mudin Simanihuruk,
Extremal Triangle-free Graphs with Prescribed 3-Defective Chromatic Number
- Jozef Siran,
Vertex-transitive and Cayley near-cages of girth six and five
- Derek H. Smith,
Linear and nonlinear constructions of DNA codes with constant GC-content
- Leonard Soicher,
On Peter Cameron's generalised t-designs
- Alan Sokal,
Complete monotonicity for inverse powers of some combinatorially defined polynomials
- Douglas S. Stones,
Latin squares with many subsquares and large autotopism groups
- Esperanza María Suárez,
Tetrahedralizations of point sets in convex position
- Malgorzata Sulkowska,
Best choice problem for directed paths
- Hiroshi Suzuki,
The Terwilliger Algebra of a Polynomial Space
- Henda Swart,
Bounds on eccentric distance sum and eccentric connectivity index of a graph
- Li-Da Tong,
The Hamiltonian Numbers of Möbius Double Loop Networks
- Andrew Treglown,
An Ore-type theorem for perfect packings in graphs
- P.-G. Tsikouras,
k-ary trees and generalized Dyck paths
- Morimasa Tsuchiya,
On strict double bound graphs
- Shoichi Tsuchiya,
Geometrically realizable triangulations on the Möbius band
- A. Umar,
Some combinatorial problems in the theory of symmetric inverse semigroups
- Kazuhiko Ushio,
Balanced (C_4,C_8)-Bowtie Designs
- J. Carlos Valenzuela,
On the lambda'-optimality of digraphs
- Frederic Vanhove,
A geometric proof of the upper bound on the size of partial spreads in H(4 n +1,q^2)
- Jan H van Vuuren,
On the Ratios between Packing and Domination Parameters of a Graph
- E. R. Vaughan,
One-factorization of regular graphs of high degree - a new bound
- Oscar Vega,
Embeddings of k-gons, graphs and linear spaces in finite planes
- José Antonio Vilches,
Optimal Discrete Morse Functions on two-dimensional PLCW-complexes
- María Trinidad Villar,
Directed Pseudo-graphs and Lie Algebras over Z/3Z
- Bartosz Walczak,
Graph eating game
- Ping Wang,
The surviving rate of a graph
- Ian Wanless,
The nearest group
- Rob Waters,
Permanents and determinants of zero-one matrices
- Bridget Webb,
The Universal locally finite Steiner triple system and other structures
- Robin Whitty,
Optimisation over subset families by ground set reduction
- Taoyang Wu,
Wiener index, complete trees and TBR graphs
- Mieko Yamada,
Difference sets over Galois rings GR(2^n, s) of odd extensions
- Tomoki Yamashita,
A degree sum condition with connectivity for relative length of longest paths and cycles
- Anders Yeo,
Hitting sets in hypergraphs and its algorithmic and theoretical applications
- Qinglin R. Yu,
On properties of generalized matching-extension graphs
Back to the British Combinatorial
Conferences
page.