25th British Combinatorial Conference
University of Warwick, 6-10 July 2015
Contributed talks:
- U. Ahmad,
The study of iteration digraphs defined on finite groups
- P. Allen,
Almost graceful labelling
- B. Atay,
Exponential domination number of cycle related graphs
- M. Bachraty,
Approaching the Moore bound for diameter 3 by Cayley graphs
- O. Bagdasar,
On the enumeration of integer tuples having the same lcm
- R. F. Bailey,
On the metric dimension of imprimitive distance-regular graphs, II
- C. Bean,
Avoiding a pair of vincular and covincular patterns
- D. Bevan,
The growth of permutations avoiding 1324
- A. Bishnoi,
The Alon-Füredi bound
- S. R. Blackburn,
Probabilistic existence results for separable codes
- P. Borg,
Cross-intersecting families
- G. Boruzanli,
On reliability of the generalized Petersen graphs
- J. Böttcher,
Chromatic thresholds in random graphs
- A. Burgess,
On the Hamilton-Waterloo Problem with odd orders
- P. J. Cameron,
Remembering Donald Preece
- A. Castillo-Ramirez,
Memoryless computation and universal simulation
- N. Cavenagh,
Which Latin square is the loneliest?
- Y. H. Chen,
The incremental network designs of the bottleneck problems
- D. V. Chopra,
On the existence and the maximum number of constraints for some combinatorial arrays
- D. Christofides,
Diameters of random Cayley graphs
- C. Çiftçi,
Local connective chromatic number of a graph
- N. E. Clarke,
Skolem labellings of generalized Dutch windmills
- A. Collins,
Clique-width, linear clique-width and well-quasi-ordering
- M. Conder,
Classifying vertex-transitive graphs by their arc-type
- E. Csóka,
Generalized solution for the Herman Protocol Conjecture
- K. K. Dabrowski,
Clique-width of restricted graph classes
- L. DeBiasio,
Covers of (pseudo)random graphs by monochromatic subgraphs
- D. Donovan,
Parameter space coverage using Latin Hypercube Sampling
- K. Ehsani,
Orientation of graphs with prescribed in-degrees and out-degrees
- M. Ellingham,
Link graphs and an unexpected application of topological graph theory
- J. A. Ellis-Monaghan,
Combinatorial strategies for self-assembly
- G. Erskine,
New constructions for large circulant graphs of given degree and diameter
- V. Falgas-Ravry,
Full subgraphs of a graph
- G. E. Farr,
The probabilistic method meets Go
- J. B. Fawcett,
Locally triangular graphs and rectagraphs with symmetry
- M. M. Ferrari,
On the partition graph of a positive integer
- J. Foniok,
Applications of adjoint functors in graph theory
- R. Freij,
Warmth and connectivity of edge spaces of graphs
- H. Galeana-Sanchez,
A characterization of panchromatic patterns
- J. B. Gauci,
Diameter vulnerability of the generalized Petersen graphs
- N. Georgiou,
Hat guessing on graphs: solvability and criticality
- P. Gordinowicz,
Cops, robbers and ordinals
- L. Grabowski,
Towards a measurable version of Lovász Local Lemma
- B. Granovsky,
Developments in the Khintchine-Meinardus method for asymptotic enumeration
- T. S. Griggs,
Combinatorics of the sonnet
- K. Gunderson,
Friendship hypergraphs
- J. Haslegrave,
Searching for a hidden moving target
- A. J. W. Hilton,
Completing y-uniform latinized squares
- J. W. P. Hirschfeld,
Open problems in finite projective spaces
- D. Horsley,
Alspach's cycle decomposition problem for multigraphs
- R. Hoyte,
Cycle decompositions of the complete graph with a hole
- P. Hu,
Mantel's theorem for random hypergraphs
- S. Huczynska,
External difference families
- G. Hurlbert,
On computing graph pebbling numbers
- T. Johansson,
On random k-out subgraphs of large graphs
- F. Joos,
The Erdős-Pósa property for cycles
- I. Karpas,
Families avoiding just one pattern
- A. Kisielewicz,
A conjecture of Clote and Kranakis
- N. Korpelainen,
On the enumeration of juggling patterns and related combinatorial objects
- R. Kwashira,
Graph compositions of suspended uniform four Combs
- R. Lang,
The list chromatic index of graphs of tree-width 3 and maximum degree at least 7
- M. Lee,
Relative m-covers of generalised quadrangles
- S. Legay,
The Problem of Tropical Homomorphism in vertex-colored graphs
- J. T. LeGrow,
Cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
- R. R. Lewis,
The degree-diameter problem for circulant graphs of arbitrary diameter up to degree 10
- A. Liebenau,
First order convergence of matroids
- I. Makhlin,
A combinatorial formula for ane Hall-Littlewood functions via a weighted Brion Theorem
- K. Markström,
Turan densities for 3-graphs
- T. A. McCourt,
Face 2-coloured triangulations and directed Eulerian digraphs on the sphere
- J. P. McSorley,
A new technique for finding small Kirkman Covering and Packing Designs; a KCD(11), a canonical KCD(13), and more examples
- K. Meeks,
Graph modication problems in epidemiology
- C. Merino,
The heterochromatic number of hypergraphs coming from matroid structures
- M. Merker,
Decomposing highly edge-connected graphs into trees of small diameter
- I. Moffatt,
Ribbon graphs and their minors
- L. Montero ,
ight lower bounds on the number of bicliques in false-twin-free graphs
- K. Morgan,
Certificates for graph polynomials
- E. G. Mphako-Banda,
Graph compositions: Some 2-edge connected graphs and some upper bounds
- R. Mycroft,
Hamilton cycles in quasirandom hypergraphs
- S. Nakamura,
The number of contractible edges in a 4-connected graph having a small number of edges not contained in triangles
- A. Nicholas Day,
Saturated graphs of prescribed minimum degree
- S. Noble,
Delta-matroids, ribbon graphs and connectivity
- P. Ó Catháin,
Trades in Hadamard matrices
- M. B. Paterson,
Characterisations of optimal algebraic manipulation detection codes
- S. Pavlíková,
New constructions of strongly invertible graphs
- D. B. Penman,
Comparable pairs and linear extensions in partially ordered sets
- T. Perrett,
A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
- D. A. Pike,
Equitably Coloured BIBDs
- T. Pinto,
Directed paths in the cube
- T. Popiel,
Point-primitive generalised polygons
- J. Przybylo,
Distant extensions of locally irregular graph colourings
- D. Quiroz,
On the chromatic number of exact distance graphs
- C. A. Rodger,
Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
- R. Scheidweiler,
Ehrhart polynomials and the Erdős multiplication table problem
- K. Shiromoto,
On covering dimension of linear codes and matroids
- R. Simanjuntak,
Strong Oriented Graphs with Largest Directed Metric Dimension
- F. Skerman,
Modularity phase transition in Erdős-Rényi random graphs
- J. Sliacan,
Flagmatic and Turán densities
- S. M. Smith,
A new product for permutation groups
- K. Staden,
On a degree sequence analogue of Posa's conjecture
- R. J. Stones,
Counting partial Latin rectangles
- W. E. Tan,
Probabilistic Intuition in Waiter-Client and Client-Waiter games
- M. Tannock,
Pattern avoidance and non-crossing subgraphs of polygons
- A. Treglown,
A random version of Sperner's theorem
- P. G. Tsikouras,
Equivalence classes of Dyck paths modulo udu
- K. Tyros,
General stability and exactness theorems
- J. van den Heuvel,
Generalised colouring numbers of graphs
- B. Walczak,
Asymmetric coloring games on incomparability graphs
- I. M. Wanless,
Symmetries of Latin Squares
- B. S. Webb,
Subsystems of Netto triple systems
- K. Wesek,
Grasshopper pattern avoidance
- R. Xu,
Weak safe sets and relaxed safe set
- L. Yepremyan,
The Local Stability Method
- A. Zak,
Hamilton saturated hypergraphs of essentially minimum size
- V. Zamaraev,
Well-quasi-ordering does not imply bounded clique-width
- E. Zamaraeva,
On k-threshold functions
Back to the British Combinatorial
Conferences
page.