26th British Combinatorial Conference
University of Strathclyde, 3-7 July 2017

Mini-symposium on Emerging Methods in Extremal Combinatorics:

• Jan Hladký, Tilings in graphons
• Peter Keevash, Forbidden vector-valued intersections
• Daniel Král', Uniqueness of optimal configurations in extremal combinatorics
• Mathias Schacht, The three edge theorem

Mini-symposium on Graph Colouring:

• Maria Axenovich, Planar graphs - improper colorings and coverings with induced forests
• Marthe Bonamy, Tight lower bounds for the complexity of multicoloring
• Jessica McDonald, List edge-colouring graphs with restricted odd cycles
• Maya Stein, Cycle partitioning in hypergraphs

Mini-symposium on Patterns in Permutations and Words:

• Alexander Burstein, Unimodal inversion sequences and pattern-avoiding classes
• Jeff Remmel, Block patterns in generalized Euler permutations and the generalized cluster method
• Bruce Sagan, Descent and peak polynomials
• Vincent Vajnovszki, The equidistribution of some descent set based statistics on words

Contributed talks:

• Timothy Alland, Pattern avoidance and fiber bundle structures on Schubert varieties
• Peter Allen, A simple proof of Shamir's conjecture
• Kiyoshi Ando, A new forbidden subgraph for 5-contractible edges
• Behrooz Bagheri Gh., Compatible cycle decomposition of bad K_5-minor-free eulerian graphs
• Robert Bailey, A database of distance-regular graphs
• Jack Bartley, The emergence of the square of a Hamilton cycle in random geometric graphs
• Christian Bean, Creating a Virtual Combinatorist
• Ferenc Bencs, Some results on the roots of the independence polynomial of graphs
• David Bevan, Prolific permutations and permuted packings
• Simon Blackburn, Non-overlapping codes
• Jason Brown, Recent results on chromatic polynomials
• Andrea Burgess, Colourings of group divisible designs
• Peter Cameron, Synchronization, association schemes and Steiner systems
• Tariq Chishti, On mark sequences in bipartite multidigraphs
• Diane Donovan, Difference covering arrays delivering high rate LDPC codes
• Yoshimi Egawa, Path-factors and odd components
• Sergi Elizalde, The structure of the consecutive pattern poset
• Jessica Enright, Adversarial games on interval and permutation graph representations
• Grahame Erskine, Large Cayley graphs of diameter three
• Khawaja Fahd, Shortest path in inner dualist of hexagonal graph
• James Fraser, Automorphisms of the Gómez graphs
• Shishuo Fu, On 1212-avoiding restricted growth functions
• Izolda Gorgol, On lower bound for induced Ramsey numbers
• Jonas Granholm, Some cyclic properties of graphs with a local Ore-type condition
• Boris Granovsky, Asymptotic enumeration by Khintchine-Meinardus probabilistic method: Necessary and sufficient conditions for exponential growth
• Terry Griggs, Pentagonal geometries
• Yujie Gu, Bounds on traceability schemes
• Robert Hancock, Independent sets in hypergraphs and Ramsey properties of graphs and the integers
• Liam Harris, Domination and independence of bishop graphs
• Johannes Hattingh, Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors
• Anthony Hilton, A variation of Ryser's theorem for partial (v_1,...,v_n)-latinized squares
• Yu-Fong Hsu, All graphs with degree 0 or 4 whose complements have 4-cycle systems
• Sophie Huczynska, Graph classes under homomorphic image order
• Mikhail Isaev, Subgraph counts for dense graphs with specified degrees
• Carl Johan Casselgren, Coloring graphs from random lists
• Robert Johnson, Ramsey problems for odd cycles
• Elizabeth Jonck, (1,1,2,3)-colourings of subcubic graphs
• Anum Khalid, Counting generalised Dyck paths
• Sandra Kingan, Characterizing excluded minor classes using the Strong Splitter Theorem
• Sergey Kitaev, Crown graphs and their representation numbers
• Nicholas Korpelainen, Variations on parking functions
• Vadim Levit, Violator spaces vs. closure spaces
• Svante Linusson, Inverse of the Pak-Stanley bijection for k-Shi arrangement
• Allan Lo, Designs beyond quasirandomness
• Eoin Long, Tournament Quasirandomness from counting
• Susana-Clara López, Characterizing path-like trees from linear configurations
• Edita Máčajová, Snarks that cannot be covered with four perfect matchings
• Adam Mammoliti, The Erdős-Ko-Rado Theorem, generalisations and beyond
• Laura Mančinska, Quantum and non-signalling graph isomorphism
• Trent Marbach, Intersection of transversals in the Latin square B_n, with applications to Latin trades
• Klas Markström, Condorcet domains and Turán type problems for permutations
• Kitty Meeks, The parameterised complexity of computing the maximum modularity of a graph
• Yotsanan Meemark, Perfect state transfer in Cayley graphs over finite chain rings
• Criel Merino, Extremal multicomplexes
• Brian Miceli, Statistics on set partitions
• Iain Moffatt, The Tutte polynomial and its extensions
• Gleb Nenashev, Hypergraphical matroids
• Tomas Nilson, A new family of triple arrays
• Cian O'Brien, Alternating signed bipartite graphs
• Olga O'Mahony, Edge-minimal graphs of exponent 2
• Paul Ouvrard, Dominating set reconfiguration
• Nicola Pace, On the existence and construction of PD-sets for linear codes
• Maura Paterson, Nonexistence results for strong external difference families
• Soňa Pavliková, Negatively invertible graphs
• HongPhong Pham, Tropical paths in vertex-colored graphs
• David Pike, Twofold triple systems with 2-intersecting Gray codes
• Shariefuddin Pirzada, On the sum of Laplacian spectra of graphs
• Vladimir Potapov, Construction of pairs of orthogonal Latin cubes
• Rachel Quinlan, Counting matrices over finite fields
• Daniel Quiroz, Colouring exact distance graphs of chordal graphs
• Sandro Rajola, On maximal partial ovoids of the elliptic quadric Q^-(5,q) of PG(5,q)
• David Roberson, Homomorphisms of strongly regular graphs
• Alia Sajjad, Optimal incomplete block designs
• Shohei Satake, Erdos-Renyi Theory for asymmetric tournaments
• Dominic Searles, Stanley symmetric functions and the slide product on weak compositions
• Aleen Sheikh, The Davenport constant of finite abelian groups
• Rinovia Simanjuntak, Distance magic labelings of distance regular graphs
• Jozef Širáň, Regular and bi-rotary maps of negative prime Euler characteristic
• Fiona Skerman, Inversions in random node labelings of random trees
• Martin Škoviera, Smallest snarks with oddness 4
• Jakub Sliacan, Juxtaposing Catalan permutation classes with monotone ones
• Douglas Stinson, Optimal ramp schemes and related combinatorial objects
• Kiki Sugeng, On antiadjacency matrix properties
• David Tankus, Generating subgraphs in chordal graphs
• Anna Taranenko, On transversals in intercalated latin squares and in the Cayley table of the group Z_2^m
• Casey Tompkins, An upper bound on the size of diamond-free families of sets
• Andrew Treglown, An improved lower bound for Folkman's Theorem
• Ann Trenk, Finding balance: Split graphs and related classes
• Rueiher Tsaur, Contractibility of graphs
• Morimasa Tsuchiya, On strict-double-bound numbers of graphs and cut sets
• James Tuite, Diregularity of extremal networks
• Jan van den Heuvel, Improper colourings inspired by Hadwiger's conjecture
• Ian Wanless, Partial latin squares that embed in an infinite group but not into any finite group
• Bridget Webb, Countably infinite homogeneous STS
• Michael Weiner, Rational Dyck paths and factor-free Dyck words
• Kai Siong Yow, Tutte invariants for alternating dimaps
• Andrzej Żak, Generalized transversals, generalized vertex covers and node-faulttolerance in graphs
• Viktor Zamaraev, Specifying a positive threshold function via extremal points
• Noam Zeilberger, Some bridges between lambda calculus and graphs on surfaces
• Jie Zheng, Bounds of the sizes of families with uncomplemented and mutually incomparable conditions
• Yan Zhuang, Shuffle-Compatible Permutation Statistics

Back to the British Combinatorial Conferences page.