A new series of short online talks organised by PhD students, for PhD students researching combinatorics, discrete maths, or computing science (although all are welcome).
The Postgraduate Combinatorial Conference is an established conference organised for, and by, current research students in all areas of combinatorial and discrete mathematics, under the auspices of the British Combinatorial Committee. The PCC is mainly aimed at UK-based students, but is also open to those from abroad. The aim of the conference is to allow research students to discuss their research in a relaxed environment, to gain practice at presenting their research outside of their own department, and to meet other young researchers in their area.
This year, we are beginning a virtual talk series, held every one or two weeks, beginning mid-November 2020.
The series continues the same aim, of allowing research students to present in an informal setting. If you are interested in giving a talk, please contact one of the organisers (on the right). If you'd like to listen to interesting research in combinatorics, discrete maths and computing science, or get to know fellow PhD students in the UK, then sign up to our mailing list, or watch this space!
Talks are held on Wednesdays at 15:30 UTC.
Click on the title of a talk to view the corresponding abstract. We also use Agora to advertise upcoming talks.
|11 November 2020||Deniz Sarikaya||A primer to topological infinite graph theory and how to force Hamiltonicity in locally finite graphs via forbidden induced subgraphs|
|25 November 2020||Alberto Espuny-Diaz||Perturbing graphs by a random regular graph: Hamiltonicity and pancyclicity|
|09 December 2020||Joseph Hyde||A Pósa-type degree sequence result for perfect matchings in 3-graphs|
|13 January 2021||He Guo||Prague dimension of random graphs|
|27 January 2021||Laura Johnson||An introduction to External Difference Families and Strong External Difference Families, and their applications to cryptography|
|10 February 2021||Vincent Pfenninger||Large monochromatic tight cycles in 2-edge-coloured complete 4-uniform hypergraphs|
|24 February 2021||Yago Moreno Alonso||Distinct distances with ℓp metrics|
|10 March 2021||Ambrose Law||Sum Systems|
|24 March 2021||Amarja Kathapurkar||Embedding spanning trees in dense directed graphs|
|07 April 2021||Ni Luh Dewi Sintiari||A survey on even-hole-free graphs|
|21 April 2020||Tássio Naia||Trees and tree-like structures in dense digraphs|
|05 May 2021||Alexander Clifton||Almost k-covers of hypercubes|
If you have any questions, please email one of the organisers: